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;
	}

}
package compete;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;

public class Dance {
	
	private static void print(String sth) {
		System.out.println(sth);
	}
	
	private static int best(int S, int P, int [] totals) {
        int ret=0;
        if (P==0) return totals.length;
        for (int i = 0;i<totals.length;i++) {
            int t = totals[i];
            if (t>=P*3-2) {
                ret++;
                continue;
            } else if (P*3>3 && t>=P*3-4 && S>0) {
                S--;
                ret++;
            }
        }
        return ret;
	}
	
	public static void main(String args[]) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("input.txt"));
		
		int num = Integer.parseInt(in.readLine());
		
		for (int i=0;i<num;i++) {
			String sentence = in.readLine();
			Scanner s = new Scanner(sentence);
			
			int N = s.nextInt();
			int S = s.nextInt();
			int P = s.nextInt();
			
			int totals[] = new int[N];
			for (int j=0;j<N;j++) {
				totals[j] = s.nextInt();
			}
			print("Case #"+(1+i)+": "+best(S,P,totals));
		}	
	}
}
