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

import java.io.*;

/**
 *
 * @author BUDDHIMA
 */
public class codejamQB {

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
        BufferedWriter out = new BufferedWriter(new FileWriter(new File("outputB-small.txt")));

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

        for (int testIndex = 1; testIndex <= tests; testIndex++) {

            String[] lineParts = br.readLine().split(" ");

            int googlers = Integer.parseInt(lineParts[0]);
            int suptrip = Integer.parseInt(lineParts[1]);
            int bestVal = Integer.parseInt(lineParts[2]);

            int count = 0;

            int[] totals = new int[googlers];

            // Fill googler total array
            for (int n = 0; n < googlers; n++) {

                totals[n] = Integer.parseInt(lineParts[3 + n]);

            }


            for (int index = 0; index < totals.length; index++) {

                int full = totals[index] / 3;
                int deci = totals[index] % 3;

                if (totals[index] < bestVal) {
                } else if ((full == bestVal - 2 && deci == 2) || (full == (bestVal - 1) && deci == 0)) { // chance to waste supprising values
                    if (suptrip > 0) {
                        suptrip--;
                        count++;
                    }
                } else if (full >= bestVal - 1) { // can compose triplets without using supprising values

                    count++;

                }


            }


            System.out.println(count);

            
            if(testIndex==tests)
            out.write("Case #" + testIndex + ": " + count );
            else out.write("Case #" + testIndex + ": " + count + "\n");



        }




        out.close();
    }
}
