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.*;
import java.io.*;
public class GoogleB {
	
	public static int doit(int s, int p, ArrayList<Integer> arr){
		int count =0 ;
		for (int i = 0; i < arr.size(); i++){
			if ((p-1>=0 && arr.get(i) >= 2*(p-1) + p) || (arr.get(i) >= 3*p)){
				count++;
				arr.remove(i);
				i--;
			}
			else if ((p-2 >= 0 && arr.get(i) >= 2*(p-2) + p && s > 0)){
				arr.remove(i);
				s--;
				i--;
				count++;
			}
		}
		return count;
	}

	public static void main(String[] args) throws Exception{
		Scanner scan = new Scanner(new File("B-small.txt"));
		int lines = scan.nextInt();
		for (int i = 0; i < lines; i++){
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			ArrayList<Integer> arr = new ArrayList<Integer>();
			for (int j = 0; j < n; j++){
				arr.add(scan.nextInt());
			}
			System.out.println("Case #" + (i+1) + ": " + doit(s, p, arr));
		}
	}
}
