/**
 * 
 */
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.util.*;
import java.io.*;

public class DancingWithGooglers {
	public void translate() throws Exception {
		Scanner sc = new Scanner(new FileReader("C:\\Users\\i047312\\Desktop\\B-small-attempt0.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C:\\Users\\i047312\\Desktop\\output_small_B.txt"));
		//Translator
		int t = sc.nextInt();
		for (int i = 0; i < t; i++) {
			pw.print("Case #" + (i + 1) + ": ");
			int n = sc.nextInt();
			int s = sc.nextInt();
			int p = sc.nextInt();
			int[][] l = new int[n][3];
			for (int j = 0; j < n; j++) {
				int score = sc.nextInt();
				int q = score / 3;
				int r = score % 3;
				if (r == 1) {
					l[j][0] = q;
					l[j][1] = q;
					l[j][2] = q + 1;
				} else if (r == 2) {
					l[j][2] = q;
					l[j][0] = q + 1;
					l[j][1] = q + 1;
				} else {
					l[j][0] = q;
					l[j][1] = q;
					l[j][2] = q;
				}
			}
			int s1 = 0;
			int count = 0;
			for (int j = 0; j < l.length; j++) {
				if (l[j][0] >= p || l[j][1] >= p || l[j][2] >= p) {
					count++;
					continue;
				} else if (s1 < s && p > 1) {
					if ((l[j][0] == p-1 && l[j][1] == p-1) || (l[j][2] == p-1 && l[j][1] == p-1) || (l[j][0] == p-1 && l[j][2] == p-1)) {
						count++;
						s1++;
						continue;
					}
				}
			}
			pw.println(count);
		}
		
		pw.flush();
		pw.close();
		sc.close();
	}
	
	public static void main(String[] args) throws Exception {
		new DancingWithGooglers().translate();
	}
}
