B'The great hero guards the country where Homer lives. The hero has attack power A and initial health value B . There are n monsters in front of the hero. The i -th monster has attack power a_i and initial health value b_i . The hero or a monster is said to be living, if his or its health value is positive (greater than or equal to 1 ); and he or it is said to be dead, if his or its health value is non-positive (less than or equal to 0 ). In order to protect people in the country, the hero will fight with monsters until either the hero is dead or all the monsters are dead. Note that the hero can fight the same monster more than once. For the safety of the people in the country, please tell them whether the great hero can kill all the monsters (even if the great hero himself is dead after killing the last monster). Each test contains multiple test cases. The first line contains t ( 1 <= t <= 10^5 ) -- the number of test cases. Description of the test cases follows. The first line of each test case contains three integers A ( 1 <= q A <= q 10^6 ), B ( 1 <= q B <= q 10^6 ) and n ( 1 <= q n <= q 10^5 ) -- the attack power of the great hero, the initial health value of the great hero, and the number of monsters. The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= q a_i <= q 10^6 ), where a_i denotes the attack power of the i -th monster. The third line of each test case contains n integers b_1, b_2, ... , b_n ( 1 <= q b_i <= q 10^6 ), where b_i denotes the initial health value of the i -th monster. It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case print the answer: "YES" (without quotes) if the great hero can kill all the monsters. Otherwise, print "NO" (without quotes). In the first example: There will be 6 fights between the he'...