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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class DancingWithTheGooglers {


	/**
	 * @param args
	 */
	public static void main(String[] args) {
		ArrayList<String> input = new ArrayList<String>();
		BufferedReader br = null;
		int googlerNumber = 0;
		int surpriseNuber = 0;
		int p = 0;
		int[] points = null;
		try {
			br = new BufferedReader(new InputStreamReader(System.in));
			int totalLineNumber = Integer.parseInt(br.readLine().trim());
			for(int i = 0;i < totalLineNumber;i++){
				input.add(br.readLine());
			}
			br.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		for(int i = 0;i < input.size();i++){
			String[] infoArray = input.get(i).split(" ");
			googlerNumber = Integer.parseInt(infoArray[0]);
			surpriseNuber = Integer.parseInt(infoArray[1]);
			p = Integer.parseInt(infoArray[2]);
			points = new int[googlerNumber];
			for(int j = 0;j < googlerNumber;j++){
				points[j] = Integer.parseInt(infoArray[3+j]);
			}
			int notSurprisePointsNumber = 0;
			int notSurprisePointsMin = 3 * p - 2;
			if(notSurprisePointsMin < 0){
				notSurprisePointsMin = p;
			}
			int surprisePointsNumber = 0;
			int surprisePointsMin = 3 * p - 4;
			if(surprisePointsMin < 0){
				surprisePointsMin = p;
			}
			int result = 0;
			if(googlerNumber != surpriseNuber){
				for(int j = 0;j < points.length;j++){
					if(points[j] >= notSurprisePointsMin){
						notSurprisePointsNumber++;
						points[j] = -100;
					}
				}
			}
			if(surpriseNuber != 0){
				for(int j = 0;j < points.length && surprisePointsNumber < surpriseNuber;j++){
					if(points[j] >= surprisePointsMin){
						surprisePointsNumber++;
						points[j] = -100;
					}
				}
			}
			result = surprisePointsNumber + notSurprisePointsNumber;
			if(p == 0){
				result = googlerNumber;
			}
			if(result > googlerNumber){
				result = googlerNumber - (result - googlerNumber);
			}
			int flag = i + 1;
			System.out.print("Case #" + flag + ": ");
			System.out.println(result);
		}
	}

}
