import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}

import java.io.*;
import java.util.Scanner;

public class Dancers {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        Scanner sc = new Scanner(new File("D:/testing/B-small-attempt0.in"));
        BufferedWriter bf = new BufferedWriter(new FileWriter("D:/testing/b.txt", false));

        int T = sc.nextInt();
        for (int i = 1; i <= T; i++) {
            int N, S, p;
            int hscr = 0, mscr = 0;
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();

            for (int j = 0; j < N; j++) {
                int scr = sc.nextInt();
                if (scr > 3 * (p - 1)) {
                    hscr++;
                } else if (p>1 &&  scr > 3 * (p - 2) + 1) {
                    mscr++;
                }
            }
            int max=hscr+ Math.min(S, mscr);
             System.out.println("Case #" + i+": "+max);
             bf.write("Case #" + i+": "+max+ "\n");
        }
        bf.close();
    }
}
