hdu4825字典树

import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main {

        public static void main(String[] args) throws IOException{
                StreamTokenizer cin = new StreamTokenizer(new BufferedInputStream(System.in)); 
                InputReader in = new InputReader(System.in)  ;
                PrintWriter out = new PrintWriter(System.out) ;

                int t = in.nextInt() ;
                for(int cas = 1 ; cas <= t ; cas++){
                     new Task().solve(cas, in, out) ;
                }

                out.flush() ;
        }

}

class  Task{

       static  class  TNode{
               int    val ;
               TNode   l , r  ;
               public  TNode(){
                       l = r = null ;
                       val = -1 ;
               }
       }

       TNode  root = new TNode() ;

       void  insert(int x){
             TNode p = root ;
             for(int i = 31 ; i >= 0 ; i--){
                  if((x & (1<<i)) == 0){
                       if(p.l == null) p.l = new TNode() ;
                       p = p.l ;
                  }
                  else{
                      if(p.r == null) p.r = new TNode() ;
                      p = p.r ;
                  }
             }
             p.val = x ;
       }

       int  ask(int x){
             TNode p = root ;
             for(int i = 31 ; i >= 0 ; i--){
                 if((x & (1<<i)) == 0 ){
                     if(p.r != null) p = p.r ;
                     else p = p.l ;
                 }
                 else{
                     if(p.l != null) p = p.l ;
                     else p = p.r ;
                 }
             }
             return p.val ;
       }

       public  void  solve(int testcas , InputReader in , PrintWriter out){
               int n = in.nextInt() , m = in.nextInt() ;
               for(int i = 0 ; i < n ; i++) insert(in.nextInt()) ;

               out.println("Case #"+ testcas + ":") ;
               for(int i = 0 ; i < m ; i++) out.println(ask(in.nextInt())) ;
       }
}



class InputReader{
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream){
           reader = new BufferedReader(new InputStreamReader(stream), 32768);
           tokenizer = null;
    }

    public String next(){
        while(tokenizer == null || !tokenizer.hasMoreTokens()){
            try{
                tokenizer = new StringTokenizer(reader.readLine());
            }catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

}