import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) throws IOException {
		String file = "B-small-attempt0";
		File inputFile = new File("C:\\Users\\Harutsedo\\Workspace\\Google Code Jam\\input\\2012\\QR\\" + file + ".in");
		File outputFile = new File("C:\\Users\\Harutsedo\\Workspace\\Google Code Jam\\input\\2012\\QR\\" + file + ".out");
		outputFile.createNewFile();
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);
		
		int T = scanner.nextInt();

		for (int c = 0; c < T; c++) {
			int N = scanner.nextInt();
			int S = scanner.nextInt();
			int p = scanner.nextInt();
			
			int[] scores = new int[N];
			for (int i = 0; i < N; i++) {
				scores[i] = scanner.nextInt();
			}
							
			String solution = solveCase(S, p, scores);
				
			StringBuffer s = new StringBuffer("Case #" + (c + 1) + ":");
			System.out.println(s + " " + solution);
			writer.write(s +  " " + solution);
			if (c != N - 1) {
				writer.write("\n");
			}
			
		}
		writer.close();
	}
	
	public static String solveCase(int S, int p, int[] scores) {
		int max = 0;
		for (int i = 0; i < scores.length; i++) {
			if ((scores[i] - p) >= 2 * p || ((scores[i] - p) >= 2 * p - 2 && p >= 1)) {
				max++;
			} else if ((scores[i] - p) >= 2 * p - 4 && S > 0 && p >= 2) {
				max++;
				S--;
			}
		}
		return String.valueOf(max);
	}

}
