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.awt.image.BufferStrategy;
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.util.ArrayList;
import java.util.Scanner;


public class DancingGooglers {
	public static void main(String[] args) {
		File file  = new File("C:\\Users\\aadi\\Desktop\\DancingGooglers\\B-small-attempt0.in");
		try{
			FileWriter fstream = new FileWriter("C:\\Users\\aadi\\Desktop\\DancingGooglers\\out.txt");
			BufferedWriter out = new BufferedWriter(fstream);
		    Scanner scanner = new Scanner(file);
		    int numOfCases = Integer.parseInt(scanner.nextLine());
		    for(int i =0 ;i< numOfCases ; i++){
		    	int sCount= 0;
		    	int non_sCount = 0;
		    	String line = scanner.nextLine();
		    	Scanner scanner2 = new Scanner(line);
		    	scanner2.useDelimiter(" ");
		    	int n =  scanner2.nextInt();
		    	int s =  scanner2.nextInt();
		    	int p =  scanner2.nextInt();
		    	while(scanner2.hasNext()){
		    		int tot = scanner2.nextInt();
		    		if(tot>=Math.max((p*3-2), 0)){
		    			non_sCount++;
		    		}else if(tot>=(p + Math.max((p-2),0) + Math.max((p-2),0)) ){
		    			sCount++;
		    		}
		    	}
		    	out.write("Case #"+(i+1)+": ");
		    	if(sCount<s){
	    			//System.out.println(non_sCount+sCount);
	    			out.write(""+(non_sCount+sCount));
	    		}else{
	    			//System.out.println(non_sCount+s);
	    			out.write(""+(non_sCount+s));
	    		}
		    	//System.out.println("");
		    	out.write(System.getProperty("line.separator"));
		    }
		    out.close();
		}catch(FileNotFoundException f){
			f.printStackTrace();
		}catch(Exception e){
			e.printStackTrace();
		}
	}

}
