/**
 * 
 */
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 ProblemB
{
	public static void main(String[] args)
	{
		String txtfile="B-small-attempt1.in";
		try
		{
			Scanner scan = new Scanner(new FileInputStream(txtfile));
			FileWriter fstream = new FileWriter("B-small-attempt1.out");
			BufferedWriter out = new BufferedWriter(fstream);
			int T = scan.nextInt();
			int N,S,p;
			int[] t ;
			int max=0;

			for (int X=1;X<=T;X++)
			{
				max = 0;
				N = scan.nextInt();
				S = scan.nextInt();
				p = scan.nextInt();
				t = new int[N];
				for (int i=0;i<N;i++)
				{
					t[i] = scan.nextInt();
				}

				Arrays.sort(t);
				int a,b;
				for (int i=N-1;i>=0;i--)
				{
					a = t[i] / 3;
					b = t[i] % 3;
					if (a>=p)
						max++;
					else if (p-a<=2)
					{
						if (b>0) a++;
						if (a<p && t[i]>0)
						{
							if (p-a==1 && b==0 && S>0)
							{
								a++;
								S--;
							}
							else if (b==2 && S>0)
							{
								a++;
								S--;
							}
						}
						if (a>=p) max++;

					}
				}
				out.write("Case #" + X + ": " + max + "\n");
			}
			out.close();
		}
		catch (Exception ex)
		{
			System.out.println(ex);
			System.exit(1);
		}

	}
}