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.*;

/**
 *
 * @author Izhari Ishak Aksa
 */
public class ProblemB {
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for (int t = 1; t <= T; t++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int ret = 0;
            
            for (int i = 0; i < n; i++) {
                int a = sc.nextInt();
                int b = a / 3;
                int c = a % 3;
                if (b >= p) {
                    ret++;
                } else if (b + 1 >= p && c >= 1) {
                    ret++;
                } else if (b + 2 >= p && c >= 2 && s > 0) {
                    ret++;
                    s--;
                } else if (b + 1 >= p && s > 0 && b > 1) {
                    ret++;
                    s--;
                }
            }
            System.out.println("Case #" + t + ": " + ret);
        }
    }
    
}
