#include <limits.h> #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define MAXN 300 using namespace std; int judge(int n,int m) { int count = 0,tmp1,tmp2; while(n||m) { tmp1=n%2; n/=2; tmp2=m%2; m/=2; if(tmp1!=tmp2) count++; } return count; } int main(void) { int T,n,m; int A[MAXN],B[MAXN]; scanf("%d",&T); while(T--) { scanf("%d %d",&m,&n); for(int i=0;i<m;i++) scanf("%d",&A[i]); sort(A,A+m); for(int i=0;i<n;i++) { scanf("%d",&B[i]); int max = INT_MAX; int flag = 0; for(int j=0;j<m;j++) { int tmp = judge(B[i],A[j]); if(max>tmp) { max=tmp; flag=j; } } printf("%d/n",A[flag]); } } return 0; }