/**
 * 
 */
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 static void main(String args[]) throws IOException
	{
		int case_no;
		String result = "";
		File inputFile = new File(".in");
		FileInputStream fin = new FileInputStream(inputFile);
		Scanner in = new Scanner(fin);

		PrintWriter out = new PrintWriter(new FileWriter(".out", true));

		case_no = in.nextInt();

		for( int i = 0; i < case_no; i++ )
		{
			int num_googlers, t_surprise, point, max_number_overp = 0, number_overp_temp = 0;
			PriorityQueue<Integer> _pq = new PriorityQueue<Integer>();
			result += "Case #"+ (i+1) + ": ";
			num_googlers = in.nextInt();
			t_surprise = in.nextInt();
			point = in.nextInt();

			for( int j = 0; j < num_googlers; j++ )
			{
				_pq.add(new Integer(in.nextInt()));
			}



			while( _pq.size()!= 0 )
			{
				int temp = _pq.poll().intValue();

				if( (temp <= 3*(point-1))&&(temp>=(3*(point-1)-1)))
				{
					if( (number_overp_temp < t_surprise)&&(temp > 0) )
					{
						number_overp_temp++;
						max_number_overp++;
					}
				}
				else if (temp > 3*(point-1))
				{
					max_number_overp++;

				}
			}

			result += "" + max_number_overp;
			out.println(result);
			result = "";
		}
		in.close();
		out.close();

	}
}
