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);
	}
  }
}
import java.util.Scanner;


public class B {

	static Scanner in = new Scanner(System.in);

	int solve() {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();
		
		int yesLimit = p + 2 * Math.max(0, p-1);
		int maybeLimit = p + 2 * Math.max(0, p-2);
		
		int yes = 0;
		int maybe = 0;

		for (int i=0; i<N; ++i) {
			int totalPoints = in.nextInt();
			if (totalPoints >= yesLimit) {
				++yes;
			} else if (totalPoints >= maybeLimit) {
				++maybe;
			}
		}
		
		return yes + Math.min(S, maybe);
	}
	
	
	public static void main(String[] args) {
		int T = in.nextInt();
		for (int i=1; i<=T; ++i) {
			int ans = new B().solve();
			System.out.println("Case #" + i + ": " + ans);
		}

	}

}
