/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

package com.google.codejam;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	
	static Scanner in;
	static BufferedWriter writer;
	public static void main(String[] args) throws IOException {
		
		in = new Scanner(new File("src/B-small-attempt0.in"));
		writer = new BufferedWriter(new FileWriter(new File("src/b.out")));

		int T = in.nextInt();
		
		for (int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			int[] t = new int[N];
			
			for (int j = 0; j < N; j++) {
				t[j] = in.nextInt();
			}
			solveCase(i, N, S, P, t);
		}
		
		writer.close();

	}

	public static int solveCase(int TEST_CASE, int N, int S, int P, int[] t) throws IOException {
		int ans = 0;
		int minSc = 3*P-2;
		int minScSup = (P==1)?1:3*P-4;
		int validCom = 0;
		int validSup = 0;
		for (int i = 0; i < t.length; i++) {
			if(t[i]>=minSc)
				validCom++;
			else if (t[i]<minSc && t[i]>=minScSup) {
				validSup++;
			}
		}
		if(validSup<=S) ans = validCom + validSup;
		else {
			ans = validCom + S;
		}
		writer.write("Case #" + TEST_CASE + ": " + ans);
		writer.newLine();
		return 0;
	}

}
