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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class DancingWithGooglers {

	public int max(int s, int q, int[] score){
		int pass = 0, fail = 0, pos = 0;
		for(int sc : score){
			if(sc == 0){
				if(q == 0)
					pass++;
				else fail++;
			}
			else if(sc == 1){
				if(q <= 1)
					pass++;
				else fail++;	
			}
			else if( (sc + 2) / 3 >= q)
				pass++;
			else if( (sc +1) / 3 +1 < q)
				fail++;
			else 
				pos++;
		}
		
		return pass + Math.min(pos, s);
		
	}
	
	
	public static void main(String[] args) throws FileNotFoundException {
		DancingWithGooglers d = new DancingWithGooglers();
//		int[] c1 = {15,13,11};
//		System.out.println(d.max(1,5,c1));
//		
//		int[] c2 = {23,22,21};
//		System.out.println(d.max(0,8,c2));
//		
//		int[] c3 = {8, 0};
//		System.out.println(d.max(1,1,c3));
//		
//		int[] c4 = {29,20, 8, 18, 18, 21};
//		System.out.println(d.max(2,8,c4));
		
		File f = new File(args[0]);
		Scanner sc = new Scanner(f);
		int l = Integer.parseInt(sc.nextLine());
		for(int i = 1; i <= l ;i++){
			String[] line = sc.nextLine().split(" ");
			int[] c = new int[Integer.parseInt(line[0])];
			int s = Integer.parseInt(line[1]);
			int q = Integer.parseInt(line[2]);
			for(int j = 0; j < c.length; j++)
				c[j] = Integer.parseInt(line[j+3]);
			System.out.printf("Case #%d: %s\n", i, d.max(s, q, c));
		}
	}

}
