import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithGooglers {

	/**
	 * @param args
	 */
	private final static String WRITE_DEST = "C:\\Users\\mkobit\\Documents\\GoogleCodeJam2012\\Dancing With the Googlers\\out.txt";
	public static void main(String[] args) {
		int T;	// T test cases
		int N;	// number of Googlers
		int S;	// surprising number of scores
		int p;	// best result score
		int howManyP = 0;
		BufferedReader in;
		PrintWriter outfile;
		try {
			in = new BufferedReader(new FileReader(args[0]));
			outfile = new PrintWriter(new FileWriter(WRITE_DEST));
			String text = in.readLine();
			T = Integer.parseInt(text);
			for (int i = 0; i < T; i++) {
				// for each test case
				howManyP = 0;
				text = in.readLine();
				//System.out.println(text);
				StringTokenizer token = new StringTokenizer(text, " ");
				N = Integer.parseInt(token.nextToken());
				S = Integer.parseInt(token.nextToken());
				p = Integer.parseInt(token.nextToken());
				//System.out.println(N);
				//System.out.println(S);
				//System.out.println("case=" + (i+1) + " p=" + p + " strange=" + S);
				while (token.hasMoreTokens()) {
					String s = token.nextToken();
					//System.out.print(s + " ");
					int score = Integer.parseInt(s);
					Googler goog = new Googler(score);
					if (goog.hasHighScore(p)) {
						//System.out.print(goog + " ");
						howManyP++;
					} else if (S > 0 && goog.weirdHighScore(p)) {
						//System.out.print(goog + " ");
						howManyP++;
						S--;
					} else {
						//System.out.print(goog + " ");
					}
				}
				//System.out.println("withp=" + howManyP);
				// write output to file
				String s = String.format("Case #%d: %d\n", i + 1, howManyP);
				outfile.write(s);
				//System.out.println(howManyP);
			}
			in.close();
			outfile.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} 
	}
}
