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 B {
    private int maxNonSurprise(int v) {
        switch (v % 3) {
            case 0: return v / 3;
            case 1:
            case 2: return v / 3 + 1;
            default: throw new AssertionError();
        }
    }

    private int maxSurprise(int v) {
        if (v <= 2) {
            return v;
        }
        switch (v % 3) {
            case 0:
            case 1: return v / 3 + 1;
            case 2: return v / 3 + 2;
            default: throw new AssertionError();
        }
    }

    public void run(Scanner in, PrintWriter out, int nCase) {
        int n = in.nextInt();
        int s = in.nextInt();
        int p = in.nextInt();
        int alreadyP = 0;
        int potentialP = 0;
        for (int i = 0; i < n; ++i) {
            int v = in.nextInt();
            if (maxNonSurprise(v) >= p) {
                ++alreadyP;
            } else {
                if (maxSurprise(v) >= p) {
                    ++potentialP;
                }
            }
        }
        int ans = alreadyP + Math.min(s, potentialP);
        out.printf("Case #%d: %d%n", nCase, ans);
    }

    public static void main(String[] args) throws FileNotFoundException {
        String filename = B.class.getSimpleName().toLowerCase();

        Scanner in = new Scanner(new File(filename + ".in"));
        PrintWriter out = new PrintWriter(filename + ".out");

        int nCases = in.nextInt();

        for (int i = 1; i <= nCases; ++i) {
            new B().run(in, out, i);
        }

        out.close();
        in.close();
    }
}
