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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;


public class B {
	private static final String INPUTFILE = "./B-large.in";
	private static final String OUTPUTFILE = "./B-large.out";
	private static FileReader in;
	private static FileWriter out;
	private static BufferedReader buffIn;
	private static BufferedWriter buffOut;
	private static Scanner s;

	public static String executeSingle(){
		int res = 0;
		int N = s.nextInt();
		int S = s.nextInt();
		int p = s.nextInt();
		int[] t= new int[N];
		for(int i=0;i<N;i++){
			t[i] = s.nextInt();
		}
		Arrays.sort(t);
		int minimumOKScore = p+Math.max(p-1, 0)*2;
		int minimumPossibleScore = p+Math.max(p-2, 0)*2;
		//tant que le score est plus grand que le plus petit plausible possible (p+p-1+p-1)
		
		for(int i=N-1;i>=0;i--){
			if(t[i]>= minimumOKScore){
				res++;
			}
			else if(t[i]>= minimumPossibleScore && S > 0){
				S--;
				res++;
			}
		}
		
		
		return ""+res;
	}


	public static void execute() throws IOException{
		int n = s.nextInt();
		s.nextLine();
		for(int i=1;i<=n;i++){
			buffOut.append("Case #"+i+": "+executeSingle());
			buffOut.newLine();
			//System.out.println("Case #"+i+": "+executeSingle());
		
		}
	}


	public static void main(String[] args) throws IOException {
		in = new FileReader(INPUTFILE);
		out = new FileWriter(OUTPUTFILE);
		buffIn = new BufferedReader(in);
		buffOut = new BufferedWriter(out);
		s = new Scanner(buffIn);
		execute();
		buffOut.flush();
		buffOut.close();
		buffIn.close();
		out.close();
		in.close();
	}

}