B"You are given an array a of n positive integers numbered from 1 to n . Let's call an array integral if for any two, not necessarily different, numbers x and y from this array, x ge y , the number <= ft lfloor frac{x}{y} right rfloor ( x divided by y with rounding down) is also in this array. You are guaranteed that all numbers in a do not exceed c . Your task is to check whether this array is integral. The input consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Description of the test cases follows. The first line of each test case contains two integers n and c ( 1 <= n <= 10^6 , 1 <= c <= 10^6 ) -- the size of a and the limit for the numbers in the array. The second line of each test case contains n integers a_1 , a_2 , ..., a_n ( 1 <= a_i <= c ) -- the array a . Let N be the sum of n over all test cases and C be the sum of c over all test cases. It is guaranteed that N <= 10^6 and C <= 10^6 . For each test case print Yes if the array is integral and No otherwise. In the first test case it is easy to see that the array is integral: Thus, the condition is met and the array is integral. In the second test case it is enough to see that <= ft lfloor frac{7}{3} right rfloor = <= ft lfloor 2 frac{1}{3} right rfloor = 2 , this number is not in a , that's why it is not integral. In the third test case <= ft lfloor frac{2}{2} right rfloor = 1 , but there is only 2 in the array, that's why it is not integral. "...