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.util.Scanner;

/**
 * Google Code Jam 2012
 * 
 * @author 7henick
 */
public class ProblemB {

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < T; i++) {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();

            int result = 0;

            for (int j = 0; j < N; j++) {
                int g = sc.nextInt();

                int min = g / 3;
                int best = g - min * 2;

                if (best - min == 0) {
                    if (best >= p) {
                        result++;
                    } else {
                        if (best + 1 >= p && min - 1 >= 0 && S > 0) {
                            result++;
                            S--;
                        }
                    }
                } else if (best - min == 1) {
                    if (best >= p) {
                        result++;
                    }
                } else if (best - min == 2) {

                    if (best - 1 >= p) {
                        result++;
                    } else {
                        if (best >= p && S > 0) {
                            result++;
                            S--;
                        }
                    }
                } else {
                    throw new Exception();
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + result);
            sc.nextLine();
        }
    }
}
