/**
 * 
 */
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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

class Dancing {

    public static void main(String args[]) throws IOException {
        Scanner in = new Scanner(new File("dance.txt"));
        PrintWriter fw = new PrintWriter(new FileWriter(new File("dance.out")));
        int cases = in.nextInt();
        for (int c = 1; c <= cases; c++) {
            int N = in.nextInt(); // number of googlers
            int S = in.nextInt(); // number of surprising triplets
            int p = in.nextInt(); // best result
            ArrayList<Integer> scores = new ArrayList<Integer>();
            for (int n = 0; n < N; n++) {
                int googler = in.nextInt();
                scores.add(googler);
            }
            Collections.sort(scores);
            int pass = 0;
            for (int i = 0; i < scores.size(); i++) {
                int score = scores.get(i);
                int mod = score % 3;
                int max = score / 3;
                int low = max;
                if (mod > 0) {
                    max++;
                }
                if (max >= p) {
                    pass++;
                    continue;
                }
                if (S > 0) {
                    if (mod % 2 == 0) {
                        if(mod == 0 && low == 0){
                            continue;
                        }
                        max++;
                        if (max >= p) {
                            pass++;
                            S--;
                            continue;
                        }
                    }
                }

            }// for loop
            String fwout = "Case #" + c + ": " + pass;
            fw.println(fwout);
        }
        fw.close();
    }
}
