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 Q2 {
	
	public static void main(String[] args) {
		
		Scanner s = new Scanner(Q2.class.getResourceAsStream("B-small-attempt1.in"));
		
		int n = s.nextInt();
		
		int nt = 1;
		while (n-- > 0) {
			
			int resp = 0;
			
			int ng = s.nextInt();
			int ex = s.nextInt();
			int nm = s.nextInt();
			
			if (nm == 0) {
				resp = ng;
				while (ng-- > 0) {
					int nota = s.nextInt();
				}	
			} else if (nm == 1) {
				while (ng-- > 0) {
					int nota = s.nextInt();
					if (nota >= 1) {
						resp++;
					}
				}	
			} else {
				while (ng-- > 0) {
					int nota = s.nextInt();
					
					if (nota >= nm * 3 - 2) {
						resp++;
					} else if (nota >= nm * 3 - 4 && ex > 0) {
						resp++;
						ex--;
					}
				}
			}
			
			System.out.println("Case #" + nt + ": " + resp);
			
			nt++;
		}
		
	}

}
