/**
 * 
 */
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.*;

class B
{
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner in = new Scanner(new File(args[0]));

		int t;

		t = Integer.parseInt(in.nextLine());

		for (int i=0; i<t; i++)
		{
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			int m = 0;

			int ti[] = new int[n];
			for (int j=0; j<n; j++)
			{
				ti[j] = in.nextInt();
			}

			for (int j=0; j<n; j++)
			{
				int d = ti[j]/3;
				int r = ti[j]%3;
				int x = p - d;

				if (x <= 0)
					m++;
				else if (x+d <= 10)
				{
					if (x==2 && r==2 && s>0)
					{
						m++;
						s--;
					}
					else if ( x == 1)
					{
						if (r==0 && d>0 && s>0)
						{
							m++;
							s--;
						}
						else if (r > 0)
							m++;
					}
				}
				if (m > n)
					m=n;
			}
			System.out.println("Case #" + (i+1) + ": " + m);
		}

	}
}
