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.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

class DancingGooglers{
    public static void main(String[] args)
    throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(br.readLine());

        for(int i=0; i<T; i++){
            String in = br.readLine();
            String[] inp = in.split(" ", 4);
            int N = Integer.parseInt(inp[0]);
            int S = Integer.parseInt(inp[1]);
            int p = Integer.parseInt(inp[2]);
            int nos = 0;
            String[] input = inp[3].split(" ");
            int[] t = new int[N];
            int[] r = new int[N];
            for(int j=0;j<N;j++){
                t[j] = Integer.parseInt(input[j]);
                r[j] = t[j]%3;
                t[j] /= 3;
                if(t[j] >= p)
                    nos++;
                if(t[j] == p - 1){
                    if(r[j] > 0)
                        nos++;
                    else if(t[j]>0){
                        nos++;
                        S--;
                    }
                }
                if(t[j] == p-2){
                    if(r[j] == 2){
                        nos++;
                        S--;
                    }
                }
            }
            if(S<0)
                nos += S;
            bw.write("Case #"+(i+1)+": "+nos+"\n");
        }
        bw.close();
    }
}