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.FileReader;
import java.io.BufferedReader;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class DancingGooglers {

		/**
		 * @param args
		 */
		public static void main(String[] args) {
			try{
				//read file
				FileReader filein = new FileReader(args[0]);
				BufferedReader in = new BufferedReader(filein);
				//write file 
				FileWriter fileout = new FileWriter("output.txt");
				BufferedWriter out = new BufferedWriter(fileout);
				//process data
				int numcases = Integer.valueOf(in.readLine()).intValue();
				for(int i=0; i<numcases; i++){
					String[] casedata = in.readLine().split(" ");
					int numgooglers = Integer.valueOf(casedata[0]);
					int totalsurprises = Integer.valueOf(casedata[1]);
					int bestresult = Integer.valueOf(casedata[2]);
					int[][] googlers = new int[numgooglers][5];
					int surprises = 0;
					for(int j=0; j<numgooglers; j++){
						googlers[j][0] = Integer.valueOf(casedata[3+j])/3;
						int max = googlers[j][0];
						int min = googlers[j][0];
						googlers[j][1] = (Integer.valueOf(casedata[3+j])-googlers[j][0])/2;
						if(googlers[j][1] > max) max = googlers[j][1];
						if(googlers[j][1] < min) min = googlers[j][1];
						googlers[j][2] = Integer.valueOf(casedata[3+j])-googlers[j][0]-googlers[j][1];
						if(googlers[j][2] > max) max = googlers[j][2];
						if(googlers[j][2] < min) min = googlers[j][2];
						googlers[j][0] = max;
						googlers[j][1] = Integer.valueOf(casedata[3+j]) - max -min;
						googlers[j][2] = min;
						googlers[j][3] = max - min;
						if(max - min > 1) surprises++;
					}
					while(surprises < totalsurprises){
						int test = 0;
						for(int j=0; j<numgooglers; j++){
							if(googlers[j][3] < 2 && googlers[j][0] == bestresult - 1 && googlers[j][1] > 0 ){
								surprises++;
								googlers[j][0]++;
								googlers[j][1]--;
								googlers[j][3] = 2;
								test = 1;
								break;
							}
						}
						if(test == 0) break;
					}
					int result = 0;
					for(int j=0; j<numgooglers; j++){
						if(googlers[j][0] >= bestresult){
							result++;
						}
					}
					out.write("Case #" + (i+1) + ": " + result + "\n");
				}
				//Close the output stream
				out.close();
				//Close the input stream
				in.close();
			}catch (Exception e){//Catch exception if any
				System.err.println("Error: " + e.getMessage());
			}
		}
}
