B'The universe is a coordinate plane. There are n space highways, each of which is a straight line y=kx passing through the origin (0, 0) . Also, there are m asteroid belts on the plane, which we represent as open upwards parabolas, i. e. graphs of functions y=ax^2+bx+c , where a > 0 . You want to photograph each parabola. To do this, for each parabola you need to choose a line that does not intersect this parabola and does not touch it. You can select the same line for different parabolas. Please find such a line for each parabola, or determine that there is no such line. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case contains 2 integers n and m ( 1 <= n, m <= 10^5 ) --the number of lines and parabolas, respectively. Each of the next n lines contains one integer k ( |k| <= 10^8 ), denoting a line that is described with the equation y=kx . The lines are not necessarily distinct, k can be equal to 0 . Each of the next m lines contains 3 integers a , b , and c ( a, |b|, |c| <= 10^8 , a > 0 ) -- coefficients of equations of the parabolas ax^2+bx+c . The parabolas are not necessarily distinct. It is guaranteed that the sum n over all test cases does not exceed 10^5 , and the sum m over all test cases also does not exceed 10^5 . For each test case, output the answers for each parabola in the given order. If there is a line that does not intersect the given parabola and doesn 't touch it, print on a separate line the word "YES", and then on a separate line the number k -- the coefficient of this line. If there are several answers, print any of them. If the line does not exist, print one word "NO". You can output the answer in any case (upper or lower)'...