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


public class Q2 {
    
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int T = s.nextInt();
        for (int i = 0; i < T; i++) {
            int N = s.nextInt();
            int S = s.nextInt();
            int P = s.nextInt();
            int[] scores = new int[N];
            for (int j = 0; j < N; j++) {
                scores[j] = s.nextInt();
            }
            System.out.println("Case #" + (i + 1) + ": " + numAboveMax(scores, S, P));
        }
    }

    private static int numAboveMax(int[] scores, int S, int P) {
        Arrays.sort(scores);
        int surprises = 0;
        int result = 0;
        if (P > 1) {
            for (int i = scores.length - 1; i >= 0; i--) {
                if (scores[i] > (3 * P - 3)) {
                    result++;
                } else if ((scores[i] > (3 * P - 5)) && (surprises < S)) {
                    result++;
                    surprises++;
                }
            }
            return result;
        } else if (P == 1) {
            for (int i = scores.length - 1; i >= 0; i--) {
                if (scores[i] > 0) {
                    result++;
                }
            }
            return result;
        } else {
            return scores.length;
        }
    }
}
