package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class dancing {

	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st = new StringTokenizer("");

	public static String next() throws Exception {
		while (true) {
			if (st.hasMoreTokens())
				return st.nextToken();
			String s = br.readLine();
			if (s == null)
				return null;
			st = new StringTokenizer(s);
		}
	}

	public static int nextInt() throws Exception {
		return Integer.parseInt(next());
	}
	
	
	public static void main(String[] args) throws Exception {
	
		int T = nextInt();
		
		for(int t = 1 ; t <= T ; t++){
			int N = nextInt();
			int S = nextInt();
			int p = nextInt();
			
			
			int count = 0;
			
			for(int i = 0 ; i < N ; i ++){
				int x = nextInt();
				if(x==0){
					if(p==0)
						count++;
					continue;
				}
				if(x==1){
					if(p<=1)
						count++;
					continue;
				}
				
				if(x % 3 == 0){
					if(x/3 >= p){
						count++;
					}else if(S>0&&x/3 + 1 >= p){
						count ++;
						S--;
					}
				}else if(x%3 == 1){
					if(x/3 +1>= p){
						count++;
					}
				}else {
					if(x/3+1 >= p){
						count++;
					}else if(S>0&&x/3 +2 >= p){
						count ++;
						S--;
					}
				}
			}
			System.out.println("Case #"+t+": "+count);
		}
		
	}
}
