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.IOException;
import java.util.StringTokenizer;

public class Judging {
	private int cases;

	public Judging() throws IOException {
		cases = Integer.valueOf(getLine());

		run();
	}

	public String getLine() throws IOException {
		String s = "";
		char c;
		while ((c = (char) System.in.read()) != '\n') {
			s += c;
		}
		return s;
	}

	public void run() throws IOException {
		Case curr;
		for (int i = 0; i < cases; i++) {
			curr = new Case(getLine());
			System.out.println("Case #" + (i+1) + ": " + curr.calculateNumBestResult());
		}
	}
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			new Judging();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

}

class Case {
	private int numberOfGooglers;
	private int numberOfSuprisingScores;
	private int bestResult;
	private int[] scores;

	public Case(String line) {
		StringTokenizer tokens = new StringTokenizer(line);

		numberOfGooglers = Integer.valueOf(tokens.nextToken());
		numberOfSuprisingScores = Integer.valueOf(tokens.nextToken());
		bestResult = Integer.valueOf(tokens.nextToken());
		scores = new int[numberOfGooglers];

		for (int i = 0; i < numberOfGooglers; i++) {
			scores[i] = Integer.valueOf(tokens.nextToken());
		}
	}

	public int calculateNumBestResult() {
		int counter = 0;
		if (bestResult >= 2) {
			for (int i = 0; i < scores.length; i++) {
				if (scores[i] - (3*bestResult) >= -2)
					counter++;
				else if (scores[i] - (3*bestResult) >= -4) {
					if (numberOfSuprisingScores > 0) {
						counter++;
						numberOfSuprisingScores--;
					}
				}
			}
		} else if (bestResult == 1) {
			for (int i = 0; i < scores.length; i++) {
				if (scores[i] > 0)
					counter++;
			}
		} else if (bestResult == 0) {
			counter = scores.length;
		} else {
			System.err.println("Error!");
		}
		return counter;
	}

}