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);
	}
  }
}
package dance;

import java.util.Scanner;

public class Dance {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();//the number of test cases
        int[] y = new int[t];

        for (int i = 0; i < t; i++) {
            int n, s, p;
            y[i] = 0;
            n = scanner.nextInt();//the number of Googlers
            int[] tp = new int[n];//the total points of the Googlers.
            s = scanner.nextInt();//the number of surprising triplets of scores
            p = scanner.nextInt();// a best result of at least p
            for (int j = 0; j < n; j++) {
                tp[j] = scanner.nextInt();
                if (((tp[j] + 2) / 3) >= p) {
                    y[i]++;
                } else if (((tp[j] + 4) / 3) >= p & s > 0&tp[j]>=2) {
                    y[i]++;
                    s--;
                }
            }

        }
        for (int i = 0; i < t; i++) {
            System.out.println("Case #"+(i+1)+": "+y[i]);
        }

    }
}
