/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.io.*;
import java.util.*;
class Problems 
{
    public static void main (String [] args) throws Exception 
    {
        BufferedReader f = new BufferedReader(new FileReader("input.java"));
        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("output.java")));
        StringTokenizer st = new StringTokenizer(f.readLine());
        int T=Integer.parseInt(st.nextToken());
        for(int t=0;t<T;t++) {
            st=new StringTokenizer(f.readLine());
            int N=Integer.parseInt(st.nextToken());
            int S=Integer.parseInt(st.nextToken());
            int p=Integer.parseInt(st.nextToken());
            int[] scores=new int[N];
            for(int i=0;i<N;i++) {
                scores[i]=Integer.parseInt(st.nextToken());
            }
            int res=0;
            int minScoreWithSurprise=p+2*(p-2);
            int minScoreWithoutSurprise=p+2*(p-1);
            for(int i=0;i<N;i++) {
                if(scores[i]==0) {
                    if(p==0) res++;
                } else if(scores[i]==1) {
                    if(p==1||p==2) res++;
                }
                else if(minScoreWithoutSurprise<=scores[i]) res++;
                else if(minScoreWithSurprise<=scores[i]&&S>0) {
                    res++;
                    S--;
                }
            }
            out.println("Case #"+(t+1)+": "+res);
        }
        out.close();
        System.exit(0);
    }
}
