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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;


public class DancingGooglers {
        public static void main(String[] args) throws IOException {
                BufferedReader fInput = new BufferedReader(new FileReader("res/inputB.in"));
                PrintWriter fOutput = new PrintWriter(new BufferedWriter(new FileWriter(
                                "res/outputB.out")));
                new DancingGooglers().run(fInput, fOutput);
                fOutput.close();
        }
        
        private void run(BufferedReader fInput, PrintWriter fOutput) throws IOException {
                int T = Integer.parseInt(fInput.readLine());
                for (int i=0; i<T; i++) {
                        int count = 0;
                        String[] inputS = fInput.readLine().split(" ");
                        
                        int N = Integer.parseInt(inputS[0]);
                        int S = Integer.parseInt(inputS[1]);
                        int p = Integer.parseInt(inputS[2]);
                        
                        for (int j=3; j<N+3; j++) {
                                int t = Integer.parseInt(inputS[j]);
                                int base = t/3;
                                
                                int max = t%3==0? base : base+1;
                                if (max >= p) {
                                        count++;
                                        continue;
                                }
                                
                                if (S == 0 || t<2 || t%3==1) continue;
                                
                                max = t%3==0? base+1 : base+2;
                                if (max >= p) {
                                        count++;
                                        S--;
                                }
                        }
                        
                        fOutput.println("Case #" + (i+1) + ": " + count);
                }
        }
}