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

import java.util.Scanner;

public class Prob2{
	public static void main(String[] args){
		Scanner scan=new Scanner(System.in);
		int n=Integer.parseInt(scan.nextLine());
		for(int i=0;i<n;i++){
			System.out.print("Case #");
			System.out.print(i+1);
			System.out.print(": ");
			System.out.println(processLine(scan.nextLine()));
		}
	}
	public static int processLine(String line){
		String[] x=line.split("\\s+");
		int n=Integer.parseInt(x[0]);
		int s=Integer.parseInt(x[1]);
		int p=Integer.parseInt(x[2]);
		int needSpec=0;
		int count=0;
		for(int i=0;i<n;i++){
			int j=Integer.parseInt(x[i+3]);
			if(maxReg(j)>=p) {
				count++;
			} else if(specPoss(j)&&maxSpecial(j)>=p) {
				needSpec++;
			}
		}
		return count+Math.min(needSpec,s);
	}
	public static int maxSpecial(int sum){
		return ((sum-2)/3)+2;
	}
	public static boolean specPoss(int sum){
		return 2<=sum&&sum<=28;
	}
	public static int maxReg(int sum){
		return (sum+2)/3;
	}
}