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.util.Scanner;


public class ProblemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int[][] maxs = genmaxs();
		
		// check correct maxs
		//for(int i = 0; i < maxs.length; i++){
		//	System.out.println(i + ": " + maxs[i][0] + " " + maxs[i][1]);
		//}
		
		int T = sc.nextInt();
		
		for(int i = 0; i < T; i++){
			int v = processCase(sc, maxs);
			
			System.out.println("Case #" + (i+1) + ": " + v);
		}
	}
	
	public static int processCase(Scanner sc, int[][] maxs){
		int numGooglers = sc.nextInt(); // N
		int numSurprising = sc.nextInt(); // S
		int maxBest = sc.nextInt(); // p
		
		int numPure = 0;
		int numImpure = 0;
		
		int[] pts = new int[numGooglers];
		
		// find the number of pure vals
		for(int i = 0; i < pts.length; i++){
			pts[i] = sc.nextInt();
			
			// check to see if purely reached
			if(maxs[pts[i]][0] >= maxBest){
				numPure++;
			} else if(maxs[pts[i]][1] >= maxBest) {
				numImpure++;
			}
		}
		
		if(numImpure > numSurprising) numImpure = numSurprising;
		
		return numPure + numImpure;
	}
	
	public static int[][] genmaxs(){
		int[][] maxs = new int[31][];
		
		// set up high maximums
		for(int i = 0; i < maxs.length; i++){
			maxs[i] = new int[]{0,0};
		}
		
		// loop through the triples
		for(int i = 0; i < 11; i++){
			for(int j = 0; j < 11; j++){
				for(int k = 0; k < 11; k++){
					int sum = i + j + k;
					int max = max(i, j, k);
					
					// find the max value in each reg and supr triple for a val
					if(isReg(i, j, k) && max > maxs[sum][0]){
						maxs[sum][0] = max;
					}
					if(isSupr(i, j, k) && max > maxs[sum][1]){
						maxs[sum][1] = max;
					}
				}
			}
		}
		
		return maxs;
	}
	
	public static int max(int i, int j, int k){
		return Math.max(i, Math.max(j, k));
	}
	
	public static boolean isReg(int i, int j, int k){
		return bigDiff(i, j, k, 1);
	}
	
	public static boolean isSupr(int i, int j, int k){
		return bigDiff(i, j, k, 2);
	}
	
	public static boolean bigDiff(int i, int j, int k, int diff){
		return Math.abs(i - j) <= diff && Math.abs(j - k) <= diff && Math.abs(k - i) <= diff;
	}

}
