package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;


public class testC {

    public static void main(String args[]){
     
        
    	 int arrayInt[];
       String str="";
       int numbersOfGooglers=0;
       int S=0;
       int P=0;
       int index=0;
       int count=0;
       int arrResults[];
       try{
           FileReader fr = new FileReader("2.txt");
           BufferedReader br = new BufferedReader(fr);
           int size = Integer.parseInt(br.readLine());
           for(int loop=0;loop<size;loop++){
        		 str= br.readLine();
        		 char arraychar[] = str.toCharArray();
        		// = new int[100];
        		 arrayInt = new int[1000];
        		index=0;
        		count=0;
        		 String s;
        		 s="";
        		 for(int i=0;i<str.length();i++){
        			 if(arraychar[i] != ' '){
        				s+=arraychar[i]; 
        			 }else{
        				 arrayInt[index++] = Integer.parseInt(s);
        				 s="";
        			 }
        		 }
        		 arrayInt[index++] = Integer.parseInt(s);
				 s="";
        		
				 
				 numbersOfGooglers = arrayInt[0];
				 S = arrayInt[1];
				 P = arrayInt[2];
				 arrResults = new int[numbersOfGooglers];
				 index=3;
				 for(int i=0;i<numbersOfGooglers;i++){
					 arrResults[i] = arrayInt[index++];  
				 }
				 
				 int SS=S;
				 int PP=P;
				 int check=0;
				 S=SS;
				 for(int i=0;i<numbersOfGooglers;i++){
					 P=PP;
					 
					while(P<30)
					{
						if(!(P-1<0 || P-2<0)){
							 if(P*3==arrResults[i] || P+(P-1)+(P-1)==arrResults[i] || P+(P+1)+(P+1)==arrResults[i] || P+(P)+(P+1)==arrResults[i] || P+(P)+(P-1)==arrResults[i])
							 {
								 count++;
								 break;
							 }
							 else if(S>0 && ( P+(P-1)+(P+1)==arrResults[i] || P+(P+2)+(P+2)==arrResults[i] || P+(P-2)+(P-2)==arrResults[i] || P+(P-1)+(P-2)==arrResults[i] || P+(P+1)+(P+2)==arrResults[i]))
							 {
								 count++;
								 S--;
								 break;	
							 }
						}else if((P-1<0)){
							 if(P*3==arrResults[i] || P+(P+1)+(P+1)==arrResults[i] || P+(P)+(P+1)==arrResults[i] )
							 {
								 count++;
								 break;
							 }
							 else if(S>0 && (  P+(P+2)+(P+2)==arrResults[i] || P+(P+1)+(P+2)==arrResults[i]))
							 {
								 count++;
								 S--;
								 break;	
							 }
						}else if((P-2<0)){
							 if(P*3==arrResults[i] || P+(P-1)+(P-1)==arrResults[i] || P+(P+1)+(P+1)==arrResults[i] || P+(P)+(P+1)==arrResults[i] || P+(P)+(P-1)==arrResults[i])
							 {
								 count++;
								 break;
							 }
							 else if(S>0 && ( P+(P-1)+(P+1)==arrResults[i] || P+(P+2)+(P+2)==arrResults[i] || P+(P+1)+(P+2)==arrResults[i]))
							 {
								 count++;
								 S--;
								 break;	
							 }
						}
						
						
					 P++;
					} 
/*					 	
							 if(arrResults[i]/P<4){
								 if(arrResults[i]%P < 2){
									 count++;
									 break;
								 }else if(arrResults[i]%P == 2 && S>0){
									 count++;
									 S--;
									 break;
								 }
							 }
								 P++;
	*/						
						
				 }
				 System.out.println("Case #"+(loop+1)+": "+count);
				/* for(int j=0;j<numbersOfGooglers;j++)
    			 System.out.print(arrResults[j]+" ");
    		 System.out.println();*/
				 
				 
  }
       br.close();
       fr.close();
   
   }catch(IOException ex){
       ex.printStackTrace();
   }
      
}


}
