import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}
package DancingWithGooglers;

public class Googler implements Comparable {

	/**
	 * @param args
	 */
	private int base;
	private int remainder;
	private int max;
	private int total;
	private boolean mayBeSurprising;
	
	public Googler(int score){
		total = score;
		remainder = score %3 ;
		base = (score - remainder) /3;
		
	}
	
	
	public int getTotal(){
		return total;
	}
	
	public int getMax(boolean canbeSur){
		if(canbeSur){
			if(remainder <= 1){
				if(base !=0){
					return base + 1;
				}
				else{
					return base;
				}
			}
			else{
				return base + 2;
			}
		}
		else{
			if(remainder <= 1){
				return base + remainder;
			}
			else{
				return base+1;
			}
			
		}
	}
	

	@Override
	public int compareTo(Object o) {
		// TODO Auto-generated method stub
		int otherTotal = ((Googler)o).getTotal();
		if(total < otherTotal){
			return -1;
		}
		else if (total == otherTotal){
			return 0;
		}
		else{
			return 1;
		}
		
	}
	
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
	}

}
