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

import java.util.Scanner;

public class Dance {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();//the number of test cases
        int[] y = new int[t];

        for (int i = 0; i < t; i++) {
            int n, s, p;
            y[i] = 0;
            n = scanner.nextInt();//the number of Googlers
            int[] tp = new int[n];//the total points of the Googlers.
            s = scanner.nextInt();//the number of surprising triplets of scores
            p = scanner.nextInt();// a best result of at least p
            for (int j = 0; j < n; j++) {
                tp[j] = scanner.nextInt();
                if (((tp[j] + 2) / 3) >= p) {
                    y[i]++;
                } else if (((tp[j] + 4) / 3) >= p & s > 0&tp[j]>=2) {
                    y[i]++;
                    s--;
                }
            }

        }
        for (int i = 0; i < t; i++) {
            System.out.println("Case #"+(i+1)+": "+y[i]);
        }

    }
}
