import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */


import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author bilal
 */
public class Googler {

    static String[] inputBuffer;
    static int testCasesCount = 0;

    public Googler(InputStream is) {
        Scanner scanner = new Scanner(is);
        testCasesCount = scanner.nextInt();
        inputBuffer = new String[testCasesCount];
        int loopCounter = 0;
        scanner.nextLine();
        while (scanner.hasNextLine()) {
            String nextTestCase = scanner.nextLine();
            inputBuffer[loopCounter] = nextTestCase;
            loopCounter++;
            if (loopCounter == testCasesCount) {
                break;
            }
        }
    }

    public void solve_Googlers(String[] input) {
        int solution = 0;
        int googlers;
        int surprisingCases;
        int targetHighestScore;
        for (int i = 0; i < input.length; i++) {//iterate over all test cases
            System.out.print("Case #" + (i + 1) + ": ");
            solution = 0;
            StringTokenizer st = new StringTokenizer(input[i]);
            googlers = Integer.parseInt(st.nextToken());
            surprisingCases = Integer.parseInt(st.nextToken());
            targetHighestScore = Integer.parseInt(st.nextToken());
            //create Score objects from remaining tokens
            LinkedList<Integer> sortedScores = new LinkedList<Integer>();
            while (st.hasMoreTokens()) {
                sortedScores.add(Integer.parseInt(st.nextToken()));
            }
            Collections.sort(sortedScores);
            //traverse over sorted collection
            for (int j = googlers - 1; j >= 0; j--) {

                int totalScore = sortedScores.get(j);
                int j1 = (int) Math.ceil(totalScore / 3.0);
                int j2 = (int) Math.ceil((totalScore - j1) / 2.0);
                int j3 = totalScore - j1 - j2;
                //System.out.println(">>>>>"+j1+" "+j2+" "+j3);
                //
                if (j1 >= targetHighestScore) {//this googler scored the higheest target score
                    solution++;
                    continue;
                }
                if (surprisingCases <= 0) {
                    break;//no more surpising cases -> no more solutions
                }
                //deal with surprising cases
                if (j1 == j2 && (j1 + 1) >= targetHighestScore && j2 > 0) {
                    surprisingCases--;
                    solution++;
                }
            }

            System.out.print(solution);
            if (i != input.length - 1) {
                System.out.println();
            }
            //break;//deal with only first case
        }


    }

    public static void main(String[] args) {
        Googler goolger = new Googler(System.in);
        goolger.solve_Googlers(inputBuffer);
    }

    class Scores {

        int totalScore;
        int j1, j2, j3;

        public Scores(int totalScore, int j1, int j2, int j3) {

            this.totalScore = totalScore;
            this.j1 = j1;
            this.j2 = j2;
            this.j3 = j3;
        }
    }
}

