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.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.util.Scanner;

public class DancingWithTheGooglersSmall {

	public static void main(String[] args) {

		File file = new File("/Users/NoK/Desktop/B-small-attempt1.in");
		int counter = 1;

		try {
			Scanner sc = new Scanner(file);

			int numOfCases = sc.nextInt();

			sc.nextLine();

			for (int i = 0; i < numOfCases; i++) {
				int numOfGooglers = sc.nextInt();
				int numOfSupTrip = sc.nextInt();
				int bestScores = sc.nextInt();
				int maxBestGooglers = 0;

				for (int j = 0; j < numOfGooglers; j++) {
					int googlerPoint = sc.nextInt();
					if (googlerPoint == 0) {
						if (bestScores == 0) {
							maxBestGooglers++;
						}
						continue;
					} else if (googlerPoint == 1) {
						if ((bestScores == 0) || (bestScores == 1)) {
							maxBestGooglers++;
						}
						continue;
					} else if (googlerPoint == 2) {
						if ((bestScores == 0) || (bestScores == 1)) {
							maxBestGooglers++;
						} else if (bestScores == 2) {
							if (numOfSupTrip > 0) {
								maxBestGooglers++;
								numOfSupTrip--;
							}
						}
						continue;
					}
					if (googlerPoint % 3 == 0) {
						if (googlerPoint / 3 >= bestScores) {
							maxBestGooglers++;
						} else {
							if (numOfSupTrip > 0) {
								if ((googlerPoint/3)+1 == bestScores) {
									maxBestGooglers++;
									numOfSupTrip--;
								}
							}
						}
					} else if (googlerPoint % 3 == 1) {
						if ((googlerPoint/3)+1 >= bestScores) {
							maxBestGooglers++;
						}
					} else if (googlerPoint % 3 == 2) {
						if ((googlerPoint/3)+1 >= bestScores) {
							maxBestGooglers++;
						} else {
							if (numOfSupTrip > 0) {
								if ((googlerPoint/3)+2 == bestScores) {
									maxBestGooglers++;
									numOfSupTrip--;
								}
							}
						}
					}
				}

				try { 
					FileWriter fw = new FileWriter("/Users/NoK/Desktop/B-small-attempt1.out", true);
					BufferedWriter bw = new BufferedWriter(fw);
					System.out.println("Case #" + counter + ": " + maxBestGooglers);
					bw.write("Case #" + counter + ": " + maxBestGooglers);
					bw.newLine();
					bw.close();
					counter++;
				} catch (Exception e){
					System.err.println("Error: " + e.getMessage());
				}

			}

		} catch (FileNotFoundException e ) {
			e.printStackTrace();
		}

	}

}