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.util.Scanner;

public class Solution {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		in.nextLine();
		int N, S, p, sure, av, note, result;
		
		for(int zz = 1; zz <= T;zz++){
			result=0;
			N = in.nextInt();
			S = in.nextInt();
			p =  in.nextInt();
			sure = p + (p-1) + (p-1);
			if (sure < p)
				sure =p;
			av = p + (p-2) + (p-2);
			if (av < p)
				av = p;
			for (int i = 1; i <= N; i++){
				note = in.nextInt();
				if (note >= sure){
					result++;
				} else if (( note < sure ) && (note >= av)){
					if (S > 0){
						S--;
						result++;
					}
				}
			}
			in.nextLine();
			System.out.format("Case #%d: %d\n",zz, result);
		}
	}
}
