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.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class PB {

    public static void main(String[] args) throws FileNotFoundException {
        if (args.length != 1) {
            System.exit(1);
        }
        File inFile = new File(args[0]);
        Scanner sc = new Scanner(inFile);
        int T = sc.nextInt();
        try (PrintWriter out = new PrintWriter("out.txt")) {
            for (int i = 0; i < T; i++) {
                int N = sc.nextInt();
                int S = sc.nextInt();
                int p = sc.nextInt();
                int[] t = new int[N];
                for (int j = 0; j < N; j++) {
                    t[j] = sc.nextInt();
                }
                int[][] scores = new int[N][3];
                for (int j = 0; j < N; j++) {
                    scores[j][0] = t[j] / 3;
                    scores[j][1] = (t[j] - scores[j][0]) / 2;
                    scores[j][2] = t[j] - scores[j][0] - scores[j][1];
                }
                int count = 0;
                for (int j = 0; j < N; j++) {
                    boolean isSurprise = false;
                    if (scores[j][2] - scores[j][0] == 2) {
                        S--;
                        isSurprise = true;
                    }
                    if (scores[j][2] >= p) {
                        count++;
                    } else {
                        if (S > 0 && !isSurprise && (p - scores[j][2]) == 1 && scores[j][1] > 0) {
                            S--;
                            scores[j][1]--;
                            scores[j][2]++;
                            count++;
                        }
                    }
                }
                out.println("Case #" + (i + 1) + ": " + count);
            }
        }
        System.out.println("Completed");
    }
}
