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.util.Scanner;

/*
4
3 1 5 15 13 11
3 0 8 23 22 21
2 1 1 8 0
6 2 8 29 20 8 18 18 21
 */
public class Problem {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);

		int test = 1,
			numberOfTests,
			dancarinos,
			erros,
			notaCorte,
			notaAtual,
			resposta;
		
		numberOfTests = scanner.nextInt();
		for( int i = 0; i < numberOfTests; i++ ){
			resposta = 0;
			
			dancarinos = scanner.nextInt();
			erros = scanner.nextInt();
			notaCorte = scanner.nextInt();
			
			int[] notas = new int[dancarinos];
			
			for( int j = 0; j < dancarinos; j++){
				notas[j] = scanner.nextInt();
			}
			
			int div, resto;
			
			for( int j = 0; j < dancarinos; j++ ){
				notaAtual = notas[j];
				div = notaAtual / 3;
				resto = notaAtual % 3;
			
				switch( resto ){
				case 0:
					if( div >= notaCorte){
						resposta++;
					}else{
						if( erros > 0 && div > 0 && div +1 >= notaCorte){
							resposta++;
							erros--;
						}
					}
					
					break;
				case 1:
			          if (div >= notaCorte || div + 1 >= notaCorte){
			              resposta++;
			          }else{
			        	  if (erros > 0 && div + 1 >= notaCorte){
			        		  resposta++;
			        		  erros--;
			        	  }
			          }
					break;
				case 2:
			          if (div + 1 >= notaCorte || div >= notaCorte){
			        	  resposta++;
			          }else{
			        	  if (erros > 0 && div + 2 >= notaCorte){
			        		  resposta++;
			        		  erros--;
			        	  }
			          }

					break;
				}
			}
			
			System.out.println("Case #"+test+": "+resposta);
			test++;
			
		}
	}
}

