Problem Description

For 2 non-negative integers x and y, f(x, y) is defined as the number of different bits in the binary format of x and y. For example, f(2, 3)=1,f(0, 3)=2, f(5, 10)=4. Now given 2 sets of non-negative integers A and B, for each integer b in B, you should find an integer a in A such that f(a, b) is minimized. If there are more than one such integer in set A, choose the smallest one.

 

Input

The first line of the input is an integer T (0 < T ≤ 100), indicating the number of test cases. The first line of each test case contains 2 positive integers m and n (0 < m, n ≤ 100), indicating the numbers of integers of the 2 sets A and B, respectively. Then follow (m + n) lines, each of which contains a non-negative integers no larger than 1000000. The first m lines are the integers in set A and the other n lines are the integers in set B.

 

Output

For each test case you should output n lines, each of which contains the result for each query in a single line.

 

 #include<cstdio>

 #include<algorithm>

 const int INF=1e9+;

 using namespace std;

 int main()

 {

     int T,i,j,p,a[],b[],minn,minx,num,m,n;

     scanf("%d",&T);

     while(T--) {

         scanf("%d%d",&m,&n);

         for(int i=;i<m;i++) {

             scanf("%d",&a[i]);

         }

         for(int i=;i<n;i++) {

             scanf("%d",&b[i]);

         }

         for(i=;i<n;i++)

         {

             minn=INF;minx=INF;

             for(j=;j<m;j++) {

                  num=;

                  p=a[j] xor b[i];

                  while(p>) {

                     if(p%!=) num++;

                     p>>=;

                  }

                 if(num<minn) { minx=a[j];minn=num;}

                 else if(num==minn && a[j]<minx)  minx=a[j];

             }

             printf("%d\n",minx);

         }

     }

     return ;

 }