/**
 * 
 */
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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingWithTheGooglers {
    public static void main(String[] args) throws IOException {
        printMaxPossibleHighScorers(new BufferedReader(new FileReader("B-small-attempt2.in")), new BufferedWriter(new FileWriter("out.txt")));
    }
    
    public static void printMaxPossibleHighScorers(BufferedReader in, BufferedWriter out) throws IOException {
        String line = in.readLine(); // we don't need to read num test cases
        int caseNum = 1;
        
        while ((line = in.readLine()) != null && line.length() != 0 ) {
            String result = "Case #" + caseNum + ": ";
            
            String[] lineDetails = line.split(" ");
            int n = Integer.parseInt(lineDetails[0]);   // googlers
            int s = Integer.parseInt(lineDetails[1]);   // surprises
            int p = Integer.parseInt(lineDetails[2]);   // high score
            int[] googlers = new int[lineDetails.length-3];
            
            for (int j = 3; j < lineDetails.length; j++) {
                googlers[j-3] = Integer.parseInt(lineDetails[j]);
            }
            
            int maxPossibleHighScorers = 0;
            int possibleHighScorers = 0;
            int surprisesLeft = s;
            for (int j = 0; j < n; j++) {
                int score = googlers[j];
                int base = score / 3;
                int offset = score % 3;
                int maxScore = -1;
                if (base > 0) {
                	maxScore = (offset == 0 ? base : base + 1);
                    if ((p - maxScore == 1) && offset != 1 && surprisesLeft > 0) {
                        maxScore++;
                        surprisesLeft--;
                    }
                } else {
                	maxScore = (score == 0 ? 0 : 1);
                    if ((p - maxScore == 1) && offset == 2 && surprisesLeft > 0) {
                        maxScore++;
                        surprisesLeft--;
                    }
                }
                 
                if (maxScore >= p) {
                    possibleHighScorers++;
                }
            }
            if (possibleHighScorers > maxPossibleHighScorers) {
                maxPossibleHighScorers = possibleHighScorers;
            }
            result += maxPossibleHighScorers;
            
            out.write(result);
            out.newLine();
            caseNum++;
        }
        in.close();
        out.close();
    }
}
