B"You have an array a of length n . Your task is to answer q queries: given x,y , find the number of pairs i and j ( 1 <= i < j <= n ) that both a_i + a_j = x and a_i cdot a_j = y . That is, for the array [1,3,2] and asking for x=3,y=2 the answer is 1 : The first line contains one integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The second line of each test case contains one integer n ( 1 <= n <= 2 cdot 10^5 ) -- the length of the array a . The third line of each test case contains n integers a_1,a_2, ... ,a_n ( 1 <= |a_i| <= 10^9 ) -- array a . The fourth line of each test case contains the integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of requests. The next q lines contain two numbers each x and y ( 1 <= |x| <= 2 cdot 10^9,1 <= |y| <= 10^{18} ) -- request. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . This is also guaranteed for the sum of q values. For each test case print a line with q numbers -- the answers to the queries. For the first test case, let's analyze each pair of numbers separately: In the second test case, all combinations of pairs are suitable. "...