package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class DancingWithTheGooglers {


	/**
	 * @param args
	 */
	public static void main(String[] args) {
		ArrayList<String> input = new ArrayList<String>();
		BufferedReader br = null;
		int googlerNumber = 0;
		int surpriseNuber = 0;
		int p = 0;
		int[] points = null;
		try {
			br = new BufferedReader(new InputStreamReader(System.in));
			int totalLineNumber = Integer.parseInt(br.readLine().trim());
			for(int i = 0;i < totalLineNumber;i++){
				input.add(br.readLine());
			}
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		for(int i = 0;i < input.size();i++){
			String[] infoArray = input.get(i).split(" ");
			googlerNumber = Integer.parseInt(infoArray[0]);
			surpriseNuber = Integer.parseInt(infoArray[1]);
			p = Integer.parseInt(infoArray[2]);
			points = new int[googlerNumber];
			for(int j = 0;j < googlerNumber;j++){
				points[j] = Integer.parseInt(infoArray[3+j]);
			}
			int notSurprisePointsNumber = 0;
			int notSurprisePointsMin = 3 * p - 2;
			if(notSurprisePointsMin < 0){
				notSurprisePointsMin = p;
			}
			int surprisePointsNumber = 0;
			int surprisePointsMin = 3 * p - 4;
			if(surprisePointsMin < 0){
				surprisePointsMin = p;
			}
			int result = 0;
			if(googlerNumber != surpriseNuber){
				for(int j = 0;j < points.length;j++){
					if(points[j] >= notSurprisePointsMin){
						notSurprisePointsNumber++;
						points[j] = -100;
					}
				}
			}
			if(surpriseNuber != 0){
				for(int j = 0;j < points.length && surprisePointsNumber < surpriseNuber;j++){
					if(points[j] >= surprisePointsMin){
						surprisePointsNumber++;
						points[j] = -100;
					}
				}
			}
			result = surprisePointsNumber + notSurprisePointsNumber;
			if(p == 0){
				result = googlerNumber;
			}
			if(result > googlerNumber){
				result = googlerNumber - (result - googlerNumber);
			}
			int flag = i + 1;
			System.out.print("Case #" + flag + ": ");
			System.out.println(result);
		}
	}

}
