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 Dance {
	public static void main(String[] args) throws FileNotFoundException{
		
		Scanner scan = new Scanner (new File("C:\\Users\\kffong\\Desktop\\JAVA_workspace\\DanceGoogler\\input.txt"));
	//	Scanner scan = new Scanner(new File("C:\\Users\\kffong\\Desktop\\JAVA_workspace\\DanceGoogler\\input.txt"));
	//	System.out.print(scan.nextLine());
		int numberOfCase = scan.nextInt();
		scan.nextLine();
		
		for(int k=0 ; k<numberOfCase; k++){
			int N = scan.nextInt();
			int surprise = scan.nextInt();
			int p = scan.nextInt();
			int total[] = new int[N];
			int result = 0;
			int possibleIncrease = 0;
			
			for ( int i = 0 ; i < N ; i++){
				total[i]=scan.nextInt();
			}

			
			
			
			for(int i = 0 ; i<N ; i++){
				int best;
				if (total[i]%3==0){
					best=total[i]/3;
				}
				else{
					best=total[i]/3 + 1;
				}
				
				
				if(best>=p){
					result++;
				}
				else if(best==p-1 && total[i]%3!=1 &&total[i]!=0){
					possibleIncrease++;
				}
			
			}
		//	System.out.println("possibleIncrease="+possibleIncrease+" ;result="+result);
			
			
			if (possibleIncrease<=surprise){
				result = result+possibleIncrease;
			}
			else{
				result = result+surprise;
			}
			System.out.println("Case #"+(k+1)+": "+result);
			
			
			//System.out.println("====================");
			
			if(scan.hasNextLine()){
				scan.nextLine();
			}
			
		}

	}
}
