B"Monocarp is playing a computer game. In this game, his character fights different monsters. A fight between a character and a monster goes as follows. Suppose the character initially has health h_C and attack d_C ; the monster initially has health h_M and attack d_M . The fight consists of several steps: The fight ends when someone's health becomes non-positive (i. xe2 x80 x89e. 0 or less). If the monster's health becomes non-positive, the character wins, otherwise the monster wins. Monocarp's character currently has health equal to h_C and attack equal to d_C . He wants to slay a monster with health equal to h_M and attack equal to d_M . Before the fight, Monocarp can spend up to k coins to upgrade his character's weapon and/or armor; each upgrade costs exactly one coin, each weapon upgrade increases the character's attack by w , and each armor upgrade increases the character's health by a . Can Monocarp's character slay the monster if Monocarp spends coins on upgrades optimally? The first line contains one integer t ( 1 <= t <= 5 cdot 10^4 ) -- the number of test cases. Each test case consists of three lines: The first line contains two integers h_C and d_C ( 1 <= h_C <= 10^{15} ; 1 <= d_C <= 10^9 ) -- the character's health and attack; The second line contains two integers h_M and d_M ( 1 <= h_M <= 10^{15} ; 1 <= d_M <= 10^9 ) -- the monster's health and attack; The third line contains three integers k , w and a ( 0 <= k <= 2 cdot 10^5 ; 0 <= w <= 10^4 ; 0 <= a <= 10^{10} ) -- the maximum number of coins that Monocarp can spend, the amount added to the character's attack with each weapon upgrade, and the amount added to the character's health with each armor upgrade, respectively. The sum of k over all test cases does not exceed 2 cdot 10^5 . For each test case, print YES if it is p"...