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;

/**
 * Google Code Jam 2012
 * 
 * @author 7henick
 */
public class ProblemB {

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < T; i++) {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();

            int result = 0;

            for (int j = 0; j < N; j++) {
                int g = sc.nextInt();

                int min = g / 3;
                int best = g - min * 2;

                if (best - min == 0) {
                    if (best >= p) {
                        result++;
                    } else {
                        if (best + 1 >= p && min - 1 >= 0 && S > 0) {
                            result++;
                            S--;
                        }
                    }
                } else if (best - min == 1) {
                    if (best >= p) {
                        result++;
                    }
                } else if (best - min == 2) {

                    if (best - 1 >= p) {
                        result++;
                    } else {
                        if (best >= p && S > 0) {
                            result++;
                            S--;
                        }
                    }
                } else {
                    throw new Exception();
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + result);
            sc.nextLine();
        }
    }
}
