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


public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		
		File fi = new File("D:\\B-small-attempt0.in");
		Scanner in=new Scanner(fi);
		int c=in.nextInt();
		int goo=0;
		int sup=0;
		int p=0;
		int ans=0;
		for(int co=1;co<=c;co++){
	   goo=in.nextInt();
	      sup=in.nextInt();
	      p=in.nextInt();
	      int base=0;
	      int score=0;
	      int z[] ={0,0,0};
		for(int i=0;i<goo;i++){
			score=in.nextInt();
			base=score/3;
			switch(score%3)
			{
			case 0: 
			{
			z[0]=base-1;
			z[1]=base;
			z[2]=base+1;
			
			if(base >=p){
				ans++;
				}
			else
			{
				if(sup>0 && base >0 && (base+1)>=p){
					ans++;
					sup--;
				}
				
			}					
			break;
			}
			case 1:
			{
			if(base >=p||(base+1)>=p){
			ans++;	
			}	
			else{
				if(sup>0&&(base+1)>=p){
					ans++;
					sup--;
				}
			}
			
			
				break;
			}
			case 2:{
				if ((base + 1) >= p|| base >= p){
					ans++;
				} else {
					if(sup>0&&(base+2)>=p){
						ans++;
						sup--;
					}
				}
				
			
			
					
			break;		
			
		}	}	
		}System.out.println("Case #"+co+": "+ans);
ans=0;
	}
	}
	}


