/**
 * 
 */
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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.Scanner;

public class Dance implements Runnable {
    public void run(){
        try {
            Scanner in = new Scanner(new File("B-small-attempt0.in"));
            PrintWriter out = new PrintWriter(new File("b.out"));
            int testNum = in.nextInt();
            for (int test = 1; test <= testNum; test++) {
                int n = in.nextInt();
                int s = in.nextInt();
                int p = in.nextInt();
                int[] a = new int[n];
                for(int i = 0; i < n; i++) {
                    a[i] = in.nextInt();
                }
                int r = 0;
                int k = 0;
                for(int i = 0; i < n; i++) {
                    if (a[i] % 3 == 0) {
                        if (a[i] / 3 >= p) {
                            r++;
                        } else if (a[i] / 3 == p - 1 && a[i] > 0) {
                            k++;
                        }
                    }
                    if (a[i] % 3 == 1) {
                        if (a[i] / 3 >= p - 1) r++;
                    }
                    if (a[i] % 3 == 2) {
                        if (a[i] / 3 >= p - 1) r++; else
                        if (a[i] / 3 == p - 2) k++;
                    }
                }
                int res = r + Math.min(k, s);
                out.println("Case #" + test + ": " + res);
            }
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    public static void main(String[] args) {
        new Dance().run();
    }
}
