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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = null;
		BufferedWriter bw = null;
		try{
			sc = new Scanner(new File("input.txt"));
			bw = new BufferedWriter(new FileWriter("gcj2a.txt"));
			
			int T = sc.nextInt();
			int N, p, s, x;
			int minNormal=0, minSur=0, totNor=0, totSur=0;
			for(int i=0;i<T;i++){
				totNor = 0; totSur = 0;
				N = sc.nextInt();
				s = sc.nextInt();
				p = sc.nextInt();
				minNormal = 3*p-2;minSur = 3*p-4;
				minSur = (minSur>p)?minSur:p;
				for(int j=0;j<N;j++){
					x = sc.nextInt();
					if(x>=minNormal)	totNor++;
					else if(x>=minSur)	totSur++;
				}
				
				totNor += s>totSur?totSur:s;
				bw.write("Case #"+(i+1)+": "+totNor);bw.newLine();
			}
		}catch(Exception e){}
		finally{
			try{
				sc.close();bw.close();
			}catch(Exception e){}
		}
	}

}
