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

/**
 *
 * @author Hilos
 */
public class ProblemB {

    public static BufferedWriter bw;
    public static BufferedReader br;

    public static void main(String[] args) {
        try {
            String filename = "B-small-attempt0";
            br = new BufferedReader(new FileReader("E:\\Downloads\\" + filename + ".in"));
            bw = new BufferedWriter(new FileWriter("E:\\Downloads\\" + filename + ".out"));

            int caseCount = Integer.parseInt(br.readLine());

            for (int c = 0; c < caseCount; c++) {
                String[] lineParts = br.readLine().split(" ");

                int N = Integer.parseInt(lineParts[0]);
                int S = Integer.parseInt(lineParts[1]);
                int p = Integer.parseInt(lineParts[2]);

                int[] scores = new int[N];

                for (int s = 0; s < N; s++) {
                    scores[s] = Integer.parseInt(lineParts[3 + s]);
                }

                SolveCase(c + 1, N, S, p, scores);
            }


        } catch (Exception exc) {
            System.out.println(exc.toString());
        }
    }

    public static void SolveCase(int caseNumber, int N, int S, int p, int[] scores) throws Exception {

        int aboveOrEqual = 0;
        int surprisingLeft = S;

        int scoreCount = scores.length;
        for (int s = 0; s < scoreCount; s++) {
            int score = scores[s];

            if(score == 0){
                if(p == 0){
                    aboveOrEqual++;   
                }
            }else  if (score % 3 == 1) {
                if ((score + 2) / 3 >= p) {
                    aboveOrEqual++;
                }
            } else if (score % 3 == 0) {
                if ((score / 3) >= p) {
                    aboveOrEqual++;
                } else if (surprisingLeft > 0 && (score / 3) + 1 >= p) {
                    aboveOrEqual++;
                    surprisingLeft--;
                }
            } else if (score % 3 == 2) {
                if (((score + 1) / 3) >= p) {
                    aboveOrEqual++;
                } else if (surprisingLeft > 0 && ((score + 1) / 3) + 1 >= p) {
                    aboveOrEqual++;
                    surprisingLeft--;
                }
            }
        }

        bw.write("Case #" + caseNumber + ": " + aboveOrEqual + "\n");
        bw.flush();
    }
}
