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.Scanner;
import java.io.*;
public class Dancing {

	public static void main(String [ ] args) throws Exception{
		Scanner in = new Scanner(new File(args[0]));
		PrintStream Output = new PrintStream(new FileOutputStream("soluzione.txt"));
		int n = in.nextInt();
		for(int i = 1; i <= n; i++){
			int tot, a, b, c;
			int contatore = 0;
			int partecipanti  = in.nextInt();
			int triplSorp = in.nextInt();
			int punteggio = in.nextInt();
			for(int j = 0; j < partecipanti; j++){
				tot = in.nextInt();
				a = tot/3;
				b = a;
				c = a;
				if (a > punteggio) contatore++;
				else{
					if (tot == (a + b + c)){ // solo in questo caso si puo avere un risultato sorpreendente
						if (a >= punteggio) contatore++;

						else if (triplSorp != 0 && a > 1){
							a++;
							if (a >= punteggio){
								contatore++;
								triplSorp--;
							}
						}
					}
					else {
						b++;
						if (tot == (a + b + c)){
							if (a >= punteggio) contatore++;
							else if (b >= punteggio) contatore++;
						}
						else{
							c++;
							if (tot == (a + b + c)){
								if (a >= punteggio) contatore++;
								else if (b >= punteggio) contatore++;
								else if(triplSorp != 0) {
									c--;
									b++;
									if (tot == (a + b + c)){							
										if (b >= punteggio) {
											triplSorp--;
											contatore++;
										}
									}

								}
							}
						}	
					}
				}
				
			}
			String x = "Case #" + i + ": "+ contatore;
			Output.println(x);
		}
	}
}
