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.IOException;
import java.io.PrintWriter;
import java.nio.charset.Charset;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.List;

/* run with JDK7 */
public class DancingWithTheGooglers {

    public static void main(String[] args) throws IOException {
        List<String> input = Files.readAllLines(Paths.get("K:/B-small-attempt0.in"), Charset.defaultCharset());
        PrintWriter output = new PrintWriter("K:/B-small-attempt0.out");
        int testCount = Integer.parseInt(input.get(0));
        for (int i = 1; i <= testCount; ++i) {
            String[] parts = input.get(i).split(" ");
            int n = Integer.parseInt(parts[0]);
            int s = Integer.parseInt(parts[1]);
            int p = Integer.parseInt(parts[2]);
            int[] t = new int[n];
            for (int j = 0; j < n; ++j)
                t[j] = Integer.parseInt(parts[3 + j]);
            // solution
            int alwaysCount = 0, surpriseCount = 0;
            for (int j=0; j<n; ++j) {
                switch (findResult(t[j], p)) {
                    case ALWAYS: ++alwaysCount; break;
                    case SURPRISE: ++surpriseCount; break;
                }
            }
            output.printf("Case #%d: %d\n", i, alwaysCount + Math.min(s, surpriseCount));
        }
        output.close();
    }

    private static Result findResult(int t, int p) {
        int base = t / 3;
        int rem = t - base * 3;
        Result r = null;
        switch (rem) {
            case 0:
                r = tryResult(t, p, base, base, base);
                if (r == null) r = tryResult(t, p, base - 1, base, base + 1);
                break;
            case 1:
                r = tryResult(t, p, base, base, base + 1);
                if (r == null) r = tryResult(t, p, base - 1, base + 1, base + 1);
                break;
            case 2:
                r = tryResult(t, p, base, base + 1, base + 1);
                if (r == null) r = tryResult(t, p, base, base, base + 2);
                break;
            default:
                assert false;
        }
        return r != null ? r : Result.NEVER;
    }

    private static Result tryResult(int t, int p, int a, int b, int c) {
        assert a + b + c == t;
        assert a <= b && b <= c;
        if (a < 0)
            return null;
        if (c >= p) {
            return c - a == 2 ? Result.SURPRISE : Result.ALWAYS;
        }
        return null;
    }

    public enum Result {
        ALWAYS,
        SURPRISE,
        NEVER,
    }
}
