/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

package dancers;
import java.io.BufferedReader;
import java.io.FileReader;
public class Dancing {
	static int solve(int N, int S, int p, int[] ts) {
		int good = 0, improveable = 0;
		for (int i = 0; i < ts.length; ++i) {
			int total = ts[i];
			int simple=0, special=0;
			if (total % 3 == 0) {
				simple = total/3;
				if (simple > 0 && simple < 10) special = simple+1;
			} else if (total % 3 == 1) {
				simple = total/3+1;
				if (total/3 > 0) special = simple;
			} else if (total % 3 == 2) {
				simple = total/3+1;
				special = simple+1;
			}
			if (simple >= p) ++good;
			else if (special >= p) ++improveable;
		}
		return good + Math.min(improveable,S);
	}
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader(args[0]));
		String line = in.readLine();
		int X = Integer.parseInt(line);
		for (int i = 0; i < X; ++i) {
			line = in.readLine();
			String[] toks = line.split(" ");
			int N = Integer.parseInt(toks[0]);
			int S = Integer.parseInt(toks[1]);
			int p = Integer.parseInt(toks[2]);
			int[] ts = new int[N];
			for (int j = 0; j < N; ++j) {
				ts[j] = Integer.parseInt(toks[3+j]);
			}
			System.out.println("Case #"+(i+1)+": "+solve(N,S,p,ts));
		}
	}
}