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 google.code.jam.dancing.with.the.googlers;

import java.util.ArrayList;

/**
 *
 * @author Lucas
 */
public class BestResultFinder {

    public ArrayList<Integer> findBestResult(ArrayList<ArrayList> list) {

        ArrayList<Integer> result = new ArrayList<Integer>();
        ArrayList<Integer> current;
        int total;
        int surprising;
        int min;
        int value;

        for (int n = 0; n < list.size(); n++) {

            current = list.get(n);
            total = 0;
            surprising = current.get(1);
            min = current.get(2);

            for (int m = 0; m < current.get(0); m++) {

                value = current.get(3 + m) / 3;

                switch (current.get(3 + m) % 3) {

                    // (n, n, n) -> Regular
                    // (n - 1, n , n + 1) -> Surprising

                    case 0: {

                        if (value >= min) {
                            total++;
                        } else if ((surprising > 0) && (value > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n, n + 1) -> Regular
                    // (n - 1, n + 1, n + 1) -> Surprising
                            
                    case 1: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 1 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                        
                    // (n, n + 1, n + 1) -> Regular
                    // (n, n, n + 2) -> Surprising
                        
                    case 2: {
                        if ((value >= min) || (value + 1 >= min)) {
                            total++;
                        } else if ((surprising > 0) && (value + 2 >= min)) {
                            total++;
                            surprising--;
                        }
                        break;
                    }
                }
            }
            result.add(total);
        }
        return result;
    }
}
