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


public class dancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException
	{
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new FileReader("problem.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i = 1; i <= t; i++)
		{
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line, " ");
			int len = Integer.parseInt(st.nextToken());
			int surp = Integer.parseInt(st.nextToken());
			int want = Integer.parseInt(st.nextToken());
			int count = 0;
			int[] vals = new int[len];
			for (int j = 0; j < len; j++)
			{
				vals[j] = Integer.parseInt(st.nextToken());
			}
			for (int k: vals)
			{
				k -= want;
				if (k <0)
					continue;
				else
				{
					if (k >= 2 * want - 2)
					{
						count++;
					}
					else if (k >= 2 * want - 4)
					{
						if (surp == 0)
							continue;
						else
						{
							surp--;
							count++;
						}
					}
				}
			}
			System.out.println("Case #" + i + ": " + count);
			
		}
	}

}
