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.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
public class B {
	public static void main(String[] args) throws IOException {
		BufferedReader input =
			new BufferedReader(new InputStreamReader(System.in));
		int a = Integer.parseInt(input.readLine());
		for (int i = 1; i <= a; i++) {
			String[] b = input.readLine().split(" ");
			int s = Integer.parseInt(b[1]);
			int p = Integer.parseInt(b[2]);
			int[] gs = new int[Integer.parseInt(b[0])];
			for (int j = 0; j < gs.length; j++) {
				gs[j] = Integer.parseInt(b[j+3]);
            }
			Arrays.sort(gs);
			int hasil = 0;
			for (int j = gs.length - 1; j >= 0; j--) {
				if (gs[j]/3 >= p) {
					hasil++;
					//System.out.println("1 " + gs[j]);
                }
				else {
					if (gs[j] % 3 == 2) {
						if (gs[j]/3 + 1 >= p) {
							hasil++;
							//System.out.println("2 " + gs[j]);
                        }
						else if (gs[j]/3 + 2 >= p && s > 0) {
							s--;
							hasil++;
							//System.out.println("3 " + gs[j]);
						}
                    }
					else if (gs[j] % 3 == 1) {
						if (gs[j]/3 + 1 >= p) {
							hasil++;
							//System.out.println("4 " + gs[j]);
                        }
					}
					else {
						if (gs[j]/3 + 1 >= p && s > 0 && gs[j]/3 > 1) {
							s--;
							hasil++;
							//System.out.println("5 " + gs[j]);
						}
					}
				}
            }
			System.out.println("Case #" + i + ": " + hasil);
        }
	}
}
