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

import java.io.File;
import java.util.Arrays;
import java.util.Scanner;

public class Qualif2 {

    public static void main(String[] args) throws Exception {

        Scanner scan = new Scanner(new File("input"));

        int num = Integer.parseInt(scan.nextLine());

        for (int i = 1; i <= num; i++) {
            int googlers = scan.nextInt();
            int surprising = scan.nextInt();
            int score = scan.nextInt();

            int[] totals = new int[googlers];

            for (int j = 0; j < googlers; j++) {
                totals[j] = scan.nextInt();
            }

            System.out.println("Case #" + i + ": " + solve(googlers, surprising, score, totals));
        }
    }

    private static int solve(int googlers, int surprising, int score, int[] totals) {
        Arrays.sort(totals);
        int count = 0;

        if (score == 0) {
            return googlers;
        }

        for (int i = totals.length - 1; i >= 0; i--) {
            int total = totals[i];
            if (total > 28) {
                count++;
                continue;
            }

            if (total == 0) {
                continue;
            }

            int base = total / 3;
            int r = total % 3;

            int n = base + (r > 0 ? 1 : 0);

            if (n >= score) {
                count++;
            } else if (surprising > 0) {
                surprising--;
                if (n + (r == 1 ? 0 : 1) >= score) {
                    count++;
                }
            } else {
                break;
            }
        }

        return count;
    }
}
