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.*;
import java.util.*;

public class DancingWithGooglers {
	public static void main(String[] args) {
		try {
			FileWriter output = new FileWriter(new File("output.txt"));
			Scanner s = new Scanner(new File("input.txt"));
			int trials = s.nextInt();
			s.nextLine();
			for (int i = 0; i < trials; i++) {
				int n = s.nextInt();
				int numSupr = s.nextInt();
				int minScore = s.nextInt();
				int cutOff = minScore + Math.max((minScore - 1), 0) * 2;
				int suprisingCutOff = minScore + Math.max((minScore - 2), 0)
						* 2;
				int totalCount = 0;
				int numSuprising = 0;
				for (int b = 0; b < n; b++) {
					int num = s.nextInt();
					if (num >= cutOff)
						totalCount++;
					else if (num >= suprisingCutOff) {
						numSuprising++;
					}
				}
				output.write("Case #" + (i + 1) + ": ");
				output.write(""
						+ (totalCount + Math.min(numSuprising, numSupr)));
				output.write('\n');
			}
			s.close();
			output.close();
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
}
