/**
 * 
 */
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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class CodeJamB
{
	public static void main(String args[]) throws Exception
	{
		Scanner in = new Scanner(new File("in.txt"));
		BufferedWriter out = new BufferedWriter(new FileWriter("out.txt"));
		int cases = in.nextInt();
		for(int casenum = 1;casenum <= cases;casenum++)
		{
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			int count = 0;
			
			for(int i=0;i<N;i++)
			{
				int curr = in.nextInt();
				if(curr==0 && P==0)
				{
					count++;
					continue;
				}
				if(curr%3 == 0 && curr!=0)
				{
					if(curr/3 >= P)
					{
						count++;
						continue;
					}
					if(curr/3+1 >= P && S>0)
					{
						S--;
						count++;
						continue;
					}
				}
				else if(curr%3 == 1)
				{
					if((curr+2)/3 >= P)
					{
						count++;
						continue;
					}
				}
				else if(curr%3 == 2)
				{
					if((curr+1)/3 >= P)
					{
						count++;
						continue;
					}
					if((curr+1)/3+1 >= P && S>0)
					{
						S--;
						count++;
						continue;
					}
				}
			}
			
			out.write("Case #" + casenum + ": "+count+"\n");
		}
		in.close();
		out.close();
	}
}