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 Q2;
public class ChooseCalc {
	private long[][] chooseCache;

	public ChooseCalc(int cacheSize, boolean readyCache) {
		chooseCache = new long[cacheSize][cacheSize];
		for(int i=0;i<cacheSize;i++){
			for(int j=0;j<cacheSize;j++){
				chooseCache[i][j] = readyCache ? perm(i, j) : -1;
			}
		}
	}

	public static long perm(int n, int k){
		if(n < k) return 0;
		long $=1;
		for(int i=n;i>Math.max(k, n-k);i--){
			$ *= i;
		}
		for(int i=1;i<=Math.min(k, n-k);i++){
			$ /= i;
		}
		return $;
	}

	public long choose(int k, int n) {
		if(chooseCache[n][k] == -1) chooseCache[n][k] = perm(n, k);
		return chooseCache[n][k];
	}

	public long cached(int k, int n){
		return chooseCache[n][k];
	}
	
	public long choosewithRep(int k, int n){
		return choose(k, n)*(n-k);
	}
}
