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

import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		try {
			Scanner scanner = new Scanner(System.in);
			int lp = scanner.nextInt();
			int c = 0;
			for (int loop = 0; loop < lp; loop++) {
				int N = scanner.nextInt();
				int S = scanner.nextInt();
				int p = scanner.nextInt();
				int ans = 0;
				for (int j = 0; j < N; j++) {
					int t = scanner.nextInt();
					if (t < 2) {
						if (p <= t) {
							ans++;
						}
					}
					if (t == 2) {
						if (p < t) {
							ans++;
						}
						if (p == t && S > 0) {
							ans++;
							S--;
						}
					}
					if (t > 2) {
						if (t / 3 >= p) {
							ans++;
						} else {
							switch (t % 3) {
							case 0:
								if (t / 3 + 1 == p && S > 0) {
									S--;
									ans++;
								}
								break;
							case 1:
								if (t / 3 + 1 == p) {
									ans++;
								}
								break;
							case 2:
								if (t / 3 + 1 == p) {
									ans++;
								} else if (t / 3 + 2 == p && S > 0) {
									ans++;
									S--;
								}
								break;
							}
						}
					}
				}
				c++;
				System.out.println("Case #" + c + ": " + ans);
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}
