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

/**
 *
 * @author ZAMAN
 */
import java.io.*;

public class test {

    public static void main(String args[]) {
        try {
            BufferedReader a = new BufferedReader(new FileReader("B-small-attempt2.in"));
            BufferedWriter b = new BufferedWriter(new FileWriter("B-small-attempt2.out"));

            int Case = Integer.parseInt(a.readLine());
            for (int i = 1; i <= Case; i++) {
                String line[] = a.readLine().split(" ");
                int c[] = new int[line.length];
                b.append("Case #" + i + ": ");
                for (int j = 0; j <= line.length - 1; j++) {
                    c[j] = Integer.parseInt(line[j]);

                }
                int contestants = c[0];
                int suprise = c[1];
                int margin = c[2];
                int best = 0;
                if (suprise == 0) {
                    for (int j = 0; j < contestants; j++) {
                        if (c[j + 3] % 3 == 0) {
                            if (c[j + 3] / 3 >= margin) {
                                best++;
                            }
                        } else if (c[j + 3] % 3 == 1 || c[j + 3] % 3 == 2) {
                            if (((c[j + 3] / 3) + 1) >= margin) {
                                best++;
                            }
                        }
                    }
                } else {
                    for (int j = 0, k = suprise; j < contestants; j++) {
                        int remain = c[j + 3] % 3;
                        int dv = c[j + 3] / 3;
                        if (remain == 0) {
                            if (dv >= margin) {
                                best++;
                            } else if (k > 0 && (dv + 1) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                                k--;
                            }
                        } else if (remain == 1) {
                            if (((dv) + 1) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                            }

                        } else if (remain == 2) {

                            if (((dv) + 1) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                            } else if (k > 0 && (dv + 2) >= margin && (dv + 1) <= c[j + 3]) {
                                best++;
                                k--;
                            }
                        }
                    }

                }
                b.append("" + best);
                b.newLine();
            }
            b.flush();
            a.close();
            b.close();

        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}