B'A cake assembly line in a bakery was once again optimized, and now n cakes are made at a time! In the last step, each of the n cakes should be covered with chocolate. Consider a side view on the conveyor belt, let it be a number line. The i -th cake occupies the segment [a_i - w, a_i + w] on this line, each pair of these segments does not have common points. Above the conveyor, there are n dispensers, and when a common button is pressed, chocolate from the i -th dispenser will cover the conveyor segment [b_i - h, b_i + h] . Each pair of these segments also does not have common points. The calibration of this conveyor belt part has not yet been performed, so you are to make it. Determine if it 's possible to shift the conveyor so that each cake has some chocolate on it, and there is no chocolate outside the cakes. You can assume that the conveyour is long enough, so the cakes never fall. Also note that the button can only be pressed once. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^5 ). The description of the test cases follows. The first line of each test case contains three integers n , w , and h ( 1 <= n <= 10^5 ; 1 <= w, h <= 10^5 ; h <= w ) -- the number of cakes and dispensers, as well as the halfwidths of cakes and segments on which the chocolate is dispensed. The second line contains n integers a_1 , a_2 , ..., a_n ( 1 <= a_i <= 10^9 ) -- the positions of the cakes centers. It is guaranteed that a_i + w < a_{i + 1} - w for all i . The third line contains n integers b_1 , b_2 , ..., b_n ( 1 <= b_i <= 10^9 ) -- the positions of the dispensers. It is guaranteed that b_i + h < b_{i + 1} - h for all i . It is guaranteed that the sum of n over all test cases does not exceed 10^5 . For each test case output "YES", if i'...