/**
 * 
 */
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 static java.lang.Math.*;

public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T; zz++) {
			System.err.println(zz);
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			int num11 = 0;
			int num10 = 0;
			int num01 = 0;
			int num00 = 0;
			for (int i = 0; i < N; i++) {
				int sum = in.nextInt();
				boolean reg = false;
				boolean sup = false;
				for(int a = 0; a <= 10; a++) {
					for(int b = 0; b <= 10; b++) {
						for(int c = 0; c <= 10; c++) {
							int min = min(a, min(b, c));
							int max = max(a, max(b, c));
							if (max-min > 2 || a + b + c != sum || max < P)
								continue;
							if (max-min == 2)
								sup = true;
							else
								reg = true;
						}
					}
				}
				if (sup && reg)
					num11++;
				else if (!sup && reg)
					num01++;
				else if(sup && !reg)
					num10++;
				else
					num00++;
			}
//			System.out.println(num00+ " "+num10+" "+num01+" "+num11);
			int ans = 0;
			for(int a = 0; a <= num11; a++) {
				for(int b = 0; b <= num10; b++) {
					for(int c = 0; c <= num01; c++) {
						int d = S - (a + b + c);
						if (d > num00 || d < 0)
							continue;
						ans = max(ans, num11 + b + num01-c);
					}
				}
			}
			
			System.out.format("Case #%d: %d\n", zz, ans);
		}
	}
}
