You are given a number Z and a set S with N elements. Your job is to find a sub set of S such that the AND of the given number and this subset is zero. If this sub set is possible print "Yes" otherwise print "No"

Input
First line contains number of test case T. Each test case contains two lines , first line contains two numbers Z and N , where Z is given number and N is size of set S . Second line contains N elements of the subset S.

Output
For each test case print Yes if the subset is possible else print No .

Constraints:
1<=T<=100
1<=N<=1000
0<=A_i<=Z<=1000000