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

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		StringBuffer pal;
		ArrayList<Integer> puntajes= new ArrayList();
		int test= sc.nextInt(), N, S, P, rare, num, count;
		for (int i=1; i<=test; i++){
			N= sc.nextInt();
			S= sc.nextInt();		
			P= sc.nextInt();
			count=0;
			P=3*P-2;
			rare= P-2;
			if (P==1) rare =1;
			System.out.print("Case #"+i+": ");
			for (int j=0; j<N; j++){
				num=sc.nextInt();
				if (num>=P){
					count++;
				}
				else if ((S>0) && (num>=rare)){
					S--;
					count++;
				}
			}
			System.out.println(count);
		}
	}
}