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.*;
import java.math.*;
import java.io.*;
import static java.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import static java.lang.Long.*;

public class QB {
    static String[] parts(BufferedReader br) throws Exception {
        String line = br.readLine();
        if (line == null) return null;
        return line.trim().split("\\s+");
    }
    public static void main (String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(in));
        int z = parseInt(br.readLine().trim());
        int v[] = new int[11111];
        for (int cas = 1; cas <= z; cas++) {
            String p[] = parts(br);
            int nums = parseInt(p[0]);
            int surp = parseInt(p[1]);
            int best = parseInt(p[2]);
            for (int i = 3, j = 0; j < nums; i++, j++) {
                v[j] = parseInt(p[i]);
            }
            //Arrays.sort(v, 0, nums);
            int count = 0;
            for (int i = nums - 1; i >= 0; i--) {
                int a = v[i];
                /*0 <= k <= 2
                x + x + 2 + x + k = a
                3x + 2 + k = a
                3x + k = a - 2
                a - 3
                x + 2 >= best*/
                if ((a + 2) / 3 >= best) {
                    count++;
              //      out.println("A: " + a);
                } else if (surp > 0 && a >= 2 && (a - 2) / 3 + 2 >= best) {
                //    out.println("B: " + a);
                    count++;
                    surp--;
                }
            }
            out.println("Case #" + cas + ": " + count);
        }
    }
}
