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


public class ProblemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BufferedReader br = null;
		BufferedWriter bw=null;
		String input=null;
		StringBuffer output = null;
		String [] splInput=null;
		int N=0,thres=0,surpri=0;
		int counter=0;
		int []g=null;
		try{
			br=new BufferedReader(new FileReader(new File("C:/Users/DHAVAL/Downloads/InputY.txt")));
			bw=new BufferedWriter(new FileWriter("outputB.txt"));
			int count=Integer.parseInt(br.readLine());
			for (int i = 0; i < count; i++) {
				input=br.readLine();
				output = new StringBuffer("Case #"+(i+1)+": ");
				splInput=input.split(" ");
				N=Integer.parseInt(splInput[0]);
				thres=Integer.parseInt(splInput[2]);
				surpri=Integer.parseInt(splInput[1]);
				counter=0;
				g=new int[N];
				for (int j = 0; j < splInput.length-3; j++) {
					g[j]=Integer.parseInt(splInput[j+3]);
				}
				for (int k = 0; k < g.length; k++) {
					switch(g[k]%3){
					case 0:
						if(g[k]/3>=thres){
							counter++;
						}else if((g[k]/3+1)>=thres&&(g[k]/3-1)>=0&&surpri!=0){
							surpri--;
							counter++;
						}
						break;
					case 1:
						if((g[k]/3+1)>=thres){
							counter++;
						}
						break;
					case 2:
						if((g[k]/3+1)>=thres){
							counter++;
						}
						else if((g[k]/3+2)>=thres&&surpri!=0){
							surpri--;
							counter++;
						}
						break;
					}
				}
				bw.write(output.toString()+counter);
				bw.newLine();
			}
			bw.close();
		}catch (Exception e) {
			e.printStackTrace();
		}

	}

}
