import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;

public class CodeJam {

//	public static final String INPUT_FILE_PATH = "D://CodeJamInput.txt";
	public static final String INPUT_FILE_PATH = "D://B-large.in";
	public static final String OUTPUT_FILE_PATH = "D://CodeJamOutput.txt";

	public static List<String> readInput() {
		List<String> list = new ArrayList<String>();
		try {
			BufferedReader input = new BufferedReader(new FileReader(
					INPUT_FILE_PATH));
			try {
				String line = null;

				while ((line = input.readLine()) != null) {
					list.add(line);
				}
			} finally {
				input.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}
		
		return list;
	}

	public static void writeOutput(List<String> output) {
		PrintWriter writer = null;
		try {
			writer = new PrintWriter(new FileWriter(OUTPUT_FILE_PATH));
			for (String line : output) {
				writer.println(line);
			}
			writer.flush();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			if (writer != null)
				writer.close();
		}
	}
	
	public static void main(String[] args) {
		List<DanceFloor> danceFloors = DanceFloor.parseFromFile(CodeJam.readInput());
		List<String> output = new ArrayList<String>();

		for(int i = 0; i < danceFloors.size(); i++) {
			System.out.println(danceFloors.get(i));
			String line = "";
			line += "Case #" + (i + 1) + ": " + danceFloors.get(i).calculate();
			output.add(line);
		}
		
		CodeJam.writeOutput(output);
	}
}

class DanceFloor {

	private List<Integer> tripletsTotalCounts;
	private int surpriseCount;
	private int targetScore;
	private int dancersCount;

	public DanceFloor(List<Integer> tripletsTotalCounts, int surpriseCount,
			int targetScore, int dancersCount) {
		this.tripletsTotalCounts = tripletsTotalCounts;
		this.surpriseCount = surpriseCount;
		this.targetScore = targetScore;
		this.dancersCount = dancersCount;
	}

	public int calculate() {
		int result = 0;
		
		if (targetScore == 0) return dancersCount;
		
		for (int i = 0; i < tripletsTotalCounts.size(); i++) {
			int total = tripletsTotalCounts.get(i);

			if (total < (targetScore * 3 - 4)) {
				tripletsTotalCounts.remove(i--);
			} else if (total == 0) {
				tripletsTotalCounts.remove(i--);
			}
		}
		
		for (int i = 0; i < tripletsTotalCounts.size(); i++) {
			int total = tripletsTotalCounts.get(i);

			if ((surpriseCount > 0) && (total == targetScore * 3 - 4)) {
				result++;
				surpriseCount--;
				tripletsTotalCounts.remove(i--);
			} else if ((surpriseCount == 0) && (total == targetScore * 3 - 4)) {
				tripletsTotalCounts.remove(i--);
			}
		}
		
		for (int i = 0; i < tripletsTotalCounts.size(); i++) {
			int total = tripletsTotalCounts.get(i);

			if ((surpriseCount > 0) && (total == targetScore * 3 - 3)) {
				result++;
				surpriseCount--;
				tripletsTotalCounts.remove(i--);
			} else if ((surpriseCount == 0) && (total == targetScore * 3 - 3)) {
				tripletsTotalCounts.remove(i--);
			}
		}
		
		result += tripletsTotalCounts.size();
		
		return result;
	}

	public static List<DanceFloor> parseFromFile(List<String> readInput) {
		List<DanceFloor> result = new ArrayList<DanceFloor>();
		int testCaseCount = Integer.parseInt(readInput.get(0));

		for (int i = 0; i < testCaseCount; i++) {
			String line[] = readInput.get(i + 1).split(" ");

			List<Integer> totalCounts = new ArrayList<Integer>();
			for (int j = 0; j < Integer.parseInt(line[0]); j++) {
				totalCounts.add(Integer.parseInt(line[3 + j]));
			}

			result.add(new DanceFloor(totalCounts, Integer.parseInt(line[1]),
					Integer.parseInt(line[2]), Integer.parseInt(line[0])));
		}

		return result;
	}

	@Override
	public String toString() {
		return "dancersCount = " + dancersCount + "; surpriseCount = " + surpriseCount 
								 + "; targetScore = " + targetScore + "; tripletsTotalCounts" 
								 + tripletsTotalCounts.toString();
	}
}


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;
	}

}
