/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.*;
import java.util.*;

public class Qual2 {


	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("B-small-attempt0.in"));
		FileWriter fw = new FileWriter("B-output.txt");
		int total = sc.nextInt();
		for(int i = 1; i <= total; i++) {
			int n = sc.nextInt(), s = sc.nextInt(), p = sc.nextInt();
			int[] scores = new int[n];
			for(int j = 0; j < n; j++) scores[j] = sc.nextInt();
			int count = 0;
			for(int j = 0; j < n; j++) {
				int div = scores[j] / 3, rem = scores[j] % 3;
				if(rem == 0) {
					if(div >= p) count++;
					else if(div == p-1 && div > 0 && s > 0) {
						s--;
						count++;
					}
				}
				else if(rem == 1) {
					if(div + 1 >= p) count++;
				}
				else if(rem == 2) {
					if(div + 1 >= p) count++;
					else if(div + 2 >= p && s > 0) {
						s--;
						count++;
					}
				}
				/*if(div >= p) count++;
				else if(rem == 1 && div + rem >= p) count++;
				else if(rem == 2) {
					if(div + rem == p) {
						if(s > 0) {
							s--;
							count++;
						}
					}
					else if(div + rem > p) count++;
				}
				else if(rem == 0 && div == p-1 && s > 0) {
					s--;
					count++;
				}*/
			}
			fw.write("Case #" + i + ": " + count + "\n");
			System.out.println("Case #" + i + ": " + count);
		}
		fw.close();
	}

}
