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 Dancing {

	public static void main(String[] args) {

		int t, n, s, p, y;
		int[] ti;
		
		Scanner scan = new Scanner(System.in);
		
		t = scan.nextInt();
		
		for(int i=1; i<=t; i++){
			
			y = 0;
			int surprised = 0;
			
			n = scan.nextInt();
			s = scan.nextInt();
			p = scan.nextInt();
			
			ti = new int[n];
			
			for(int j=0; j<n; j++){
				ti[j] = scan.nextInt();
			}
			
			int limiteInf;
			
			if(p <= 1)
				limiteInf = p;
			else
				limiteInf = p + 2 * (p - 2);
			
			for(int j=0; j<ti.length; j++){
				
				if(limiteInf == 0){
					y++;
				}else if(ti[j] >= (limiteInf + 2)){
					y++;
					//System.out.println("Entrou 1: " + ti[j]);
				}else if(ti[j] >= limiteInf && ti[j] < (limiteInf + 2) && surprised < s){
					y++;
					surprised++;
					//System.out.println("Entrou 2: " + ti[j]);
				}
			}
			
			
			
			System.out.println("Case #" + i + ": " + y);
		}
	}

}
