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


import java.io.FileInputStream;
import java.io.IOException;
import java.util.Scanner;

public class Task2 {

    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new FileInputStream("task21.txt"));
        int T = scanner.nextInt();
        for (int i = 0; i < T; i++) {
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int[] t = new int[N];
            for (int j = 0; j < N; j++) {
                t[j] = scanner.nextInt();
            }
            int noProbMin = Math.max(p * 3 - 2, p);
            int surpriseMin = Math.max(p * 3 - 4, p);
            int noProbCount = 0;
            int surpriseCount = 0;
            for (int googler : t) {
                if (googler >= noProbMin) {
                    noProbCount++;
                }
                if (googler < noProbMin && googler >= surpriseMin) {
                    surpriseCount++;
                }
            }
            surpriseCount = Math.min(surpriseCount, S);
            System.out.println("Case #" + (i + 1) + ": " + (noProbCount + surpriseCount));
        }
    }
}
