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.DataInputStream;
import java.io.DataOutputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;


public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		try{
			  // Open the file that is the first 
			  // command line parameter
			
			  FileInputStream fstream = new FileInputStream("B-large.in");
			  // Get the object of DataInputStream
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  
			  FileOutputStream ostream  = new FileOutputStream("Output.txt");
			  DataOutputStream out = new DataOutputStream(ostream);
			  BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(out));
			  
			  int count = Integer.parseInt(br.readLine());
			  for (int i = 0; i < count; i++)   {
				  String lineString = br.readLine();
				  String [] arrayLineString = lineString.split(" ");
				  int googlersCount = Integer.parseInt(arrayLineString[0]);
				  
				  if (googlersCount > 0 && googlersCount <= 100);
				  	else break;
					  
				  int surprisingResultsCount = Integer.parseInt(arrayLineString[1]);
				  
				  if (surprisingResultsCount >= 0 && surprisingResultsCount <= googlersCount);
				  	else break;
				  
				  int maxNumber = Integer.parseInt(arrayLineString[2]);
				  
				  if (maxNumber >= 0 && maxNumber <= 10);
				  	else break;
				  
				  int maxSumForSurprisngResults = maxNumber + (maxNumber - 2) * 2;
				  if (maxSumForSurprisngResults >=2);
				  	else maxSumForSurprisngResults = 2;
				  
				  int maxSumForNormalResults = maxNumber + (maxNumber - 1) * 2;
				  
				  int scoresArray [] = convertArrayStringToNumbers(arrayLineString, googlersCount);
				  
				  Arrays.sort(scoresArray);
				  int answerCount = 0;
				  for (int j = (scoresArray.length - 1); j >= 0; j--){
					  if (scoresArray[j] >= 0 && scoresArray[j] <= 30);
					  	else break;
					  
					  if (scoresArray[j] >= maxSumForNormalResults){
						  answerCount++;
					  }
					  else if (scoresArray[j] >= maxSumForSurprisngResults){
							  if (surprisingResultsCount > 0){
								  surprisingResultsCount--;
								  answerCount++;
							  }
							  else break;
							}
					  else break;	  
				  }
				   bw.write("Case #" + (i+1) + ": " + answerCount);
				   bw.newLine();
				   bw.flush();				  
					  
			  }
			  //Close the input stream
			  in.close();
			  out.close();
			    }catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
			  }
	}

	private static int [] convertArrayStringToNumbers(String[] arrayLineString, int count) {
		// TODO Auto-generated method stub
		int array [] = new int[count];
		for (int i = 3; i < arrayLineString.length; i++){
			array[i-3] = Integer.parseInt(arrayLineString[i]);
		}
		return array;
	}

}
