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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class googleDancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		ArrayList<Integer> lstInt = new ArrayList<Integer>();
		boolean error_ni = false;
		try{
			 FileReader fr=new FileReader("B-large.in"); 
		
			 BufferedReader  br = new BufferedReader (fr);
		     int numCases = Integer.parseInt(br.readLine());
		     BufferedWriter bw = new BufferedWriter(new FileWriter(new File("solution.txt")));
		     int i;
		     

		     for(i=1; i<=numCases; i++ ){
		    	 String linea = new String(br.readLine());
		    	 StringTokenizer palabraSeparation = new StringTokenizer(linea);
		    	 lstInt.clear();
		    	 int N = Integer.parseInt(palabraSeparation.nextToken());
		    	 int S = Integer.parseInt(palabraSeparation.nextToken());
		    	 int p = Integer.parseInt(palabraSeparation.nextToken());
		    	 int solution = 0;
		    	 int surprising = 0;
		    	 while(palabraSeparation.hasMoreTokens() != false){
		    		 int num_i = Integer.parseInt(palabraSeparation.nextToken());
		    		 lstInt.add(num_i);
		    		 /*if (num_i > 30)
		    			 error_ni = true;*/
		    	 }
		    
		    	
		    
		    	 if ((S>=0  && S <= N) && (p>= 0 && p <= 10) && error_ni == false){
		    		 if (p==0){
		    			 solution = lstInt.size();
		    		
		    		 }
		    		 else
				    		 for (int j=0; j<lstInt.size(); j++){ 
				    			  
				    			 if (p == 1  ){
				    				 if (lstInt.get(j)>0) solution++;
				    			 }	  
				    			 else if (p*3 <= lstInt.get(j) && lstInt.get(j)!=0 ){
				    				 solution++;
				    			 }
				    			 else if(p*3-2 <= lstInt.get(j) && p>=1 && lstInt.get(j)!=0 ){
				    				 solution++;
				    			 }
				    			 else if(p*3-4 <= lstInt.get(j) && lstInt.get(j) >= 2 && lstInt.get(j)<=28){
				    				 surprising++;
				    			 }
				    			 	 
				    		 }
				    		 if(S >= surprising)
			    				 solution +=surprising;
					    	 else if(S < surprising )
					    		 solution +=S;
				    	 }
				    	 
				    	 
				    	 //System.out.println("Case #" + i+": "+solution);
				    	bw.write("Case #" + i+": "+solution);
				        bw.newLine();
				         
				     }
		     
		 bw.close();
		}catch (Exception e){//Catch exception if any
		    	  System.err.println("Error: " + e.getMessage());
		}
			  
		


	}

}
