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;
	}

}


import java.io.*;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;

public class Main2 {

    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new BufferedReader(new FileReader("in.txt")));
            BufferedWriter out = new BufferedWriter(new FileWriter("out.txt"));
            int t;
            t = in.nextInt();
            in.nextLine();
            for (int i = 1; i <= t; i++) {
                int n, s, p;
                n = in.nextInt();
                int g[] = new int[n];
                s = in.nextInt();
                p = in.nextInt();
                for (int j = 0; j < n; j++) {
                    g[j] = in.nextInt();
                }
                in.nextLine();
                int count = 0;
                for (int k = 0; k < g.length; k++) {
                    if (g[k] != 0 || p == 0) {
                        int div = g[k] / 3;
                        int mod = g[k] % 3;
                        if (mod == 0) {
                            if (div >= p) {
                                count++;
                            } else if (div + 1 >= p && s > 0) {
                                count++;
                                s--;
                            }
                        } else if (mod == 1) {
                            if (div + 1 >= p) {
                                count++;
                            }
                        } else {
                            if (div + 1 >= p) {
                                count++;
                            } else if (div + 2 >= p && s > 0) {
                                count++;
                                s--;
                            }
                        }
                    }
                }

                String toPrint = "Case #" + i + ": " + count;
                if (i != t) {
                    toPrint += "\n";
                }
                out.write(toPrint);
            }
            in.close();
            out.close();
        } catch (Exception ex) {
            Logger.getLogger(Main2.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
