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.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;

public class MaxDancers {

	public static void main(String[] args)throws IOException {

		String fichierentree= "/home/marwen/TÃ©lÃ©chargements/B-large.in";
		String fichiersortie= "/home/marwen/Bureau/output.in";

		BufferedWriter	 wr= new BufferedWriter(new FileWriter(fichiersortie));
		DataInputStream	 rd= new DataInputStream(new FileInputStream(fichierentree));		
		
		//Reading number of cases
		String ligne = rd.readLine();
		int cases = Integer.valueOf(ligne);
		
		int k;
		for (k=1;k<=cases;k++) 
		{
			//Reading ligne by ligne
			ligne = rd.readLine();
			ligne=ligne+" ";
			
			// Reading length of the table and filling in it with numbers
			
			int taille = Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
			int [] T1= new int [3+taille];
			T1[0]=taille;
			int i,val;
			for (i=1;i<3+taille;i++)
			{
				 ligne=ligne+" ";
				 ligne = ligne.substring(ligne.indexOf(" ") + 1);
				 val = Integer.valueOf(ligne.substring(0, ligne.indexOf(" ")));
				 T1[i]=val;
			}
			
			// End of Reading table from ligne
			
			//Solving the problem for each Line
			
			int s,p,nb,l;
			s=T1[1];
			p=T1[2];
			nb=0;
			l=T1.length;
			for(i=3;i<l;i++)
			{
				if (T1[i]>=p)
				{
				if (T1[i]>=3*p-2) {nb++;}
				else {if ((T1[i]>=3*p-3)||(T1[i]>=3*p-4)){if (s>0){nb++;s--;}}}
				}
			}
			
			//Writing into the output file before moving to the next Line
			wr.write("Case #"+k+": "+nb);
			wr.newLine();
		}	
		
	wr.close();
	rd.close();
	}
}
