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

public class GooglerDancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new GooglerDancing().run();

	}
	
	public void run(){
		
		int numDancers, targetScore, numSurprising, score, numWins;
		ArrayList<Dancer> dancers;
		Scanner input = new Scanner(System.in);
		int numCases = input.nextInt();
		input.nextLine();
		int caseNum = 1;
		
		while(caseNum <= numCases){
			
			numWins = 0;
			dancers = new ArrayList<Dancer>();
			numDancers = input.nextInt();
			numSurprising = input.nextInt();
			targetScore = input.nextInt();
			for(int dancer = 0; dancer < numDancers; dancer++){
				score = input.nextInt();
				dancers.add(new Dancer(score));
			}
			
			for(Dancer d : dancers){
				if(d.DefiniteWin(targetScore)){
					numWins++;
				} else if(d.score == 0 || d.DefiniteLoss(targetScore)){
					
					// Do nothing
				} else if (numSurprising > 0 && d.WinningSurprise(targetScore)){
					numWins++;
					numSurprising--;
				}
			}
			System.out.printf("Case #%d: %d%n", caseNum, numWins);
			caseNum++;
		}
	}

}

class Dancer {
	
	public int score;
	
	public Dancer(int score){
		this.score = score;
	}
	
	public boolean WinningSurprise(int targetScore){
		
		int firstScore = score - targetScore;
		int remainder = firstScore - (targetScore - 2);
		if(remainder >= (targetScore - 2)){
			return true;
		}
		return false;
	}
	
	public boolean DefiniteWin(int targetScore){
		int border = targetScore - 1;
		double avg = score / 3.0;
		if(avg > border){
			return true;
		}
		return false;
	}
	
	public boolean DefiniteLoss(int targetScore){
		int border = targetScore - 2;
		double avg = score / 3.0;
		if(avg >= border){
			return false;
		}
		return true;
	}
	
}
