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


public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		Scanner reader = new Scanner(new File("B-small-attempt1.in"));
		PrintWriter writer = new PrintWriter(new File("output.txt"));
		int cases = reader.nextInt();
		for (int i=0; i<cases; i++) {
			int N = reader.nextInt();
			int S = reader.nextInt();
			int P = reader.nextInt();
			int[] G = new int[N];
			int X = 0;
			int K = 0;
			for (int j=0; j<N; j++) {
				G[j] = reader.nextInt();
				int score = G[j];
				int base =  (int) Math.ceil(G[j] /3);
				switch (score % 3) {
				case 0:
					if (base >= P) {
						X++;
					} else if (K < S && base > 0 && (base + 1) >= P) {
						K++;
						X++;
					}
					break;
				case 1:
					if (base >= P || (base + 1) >= P) {
						X++;
					} else if (K < S && (base + 1) >= P) {
						K++;
						X++;
					}
					break;
				case 2:
					if ((base + 1) >= P || base >= P) {
						X++;
					} else if (K < S && (base + 2) >= P) {
						K++;
						X++;
					}
					break;
				}
			}
			writer.println("Case #" + (i+1) + ": " + X);
		}
		System.out.println("done");
		reader.close();
		writer.close();
	}

}
