/*
 * 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 gcj2012.qr;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class ProblemB {
	public static void main(String[] args) throws FileNotFoundException, IOException{		
		BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("B-small-attempt0.out"));
		int t = Integer.parseInt(br.readLine());
		int n, surpresas, melhor;
		for (int i=1; i<=t; i++){
			String campos[] = br.readLine().split(" ");
			n = Integer.parseInt(campos[0]);
			surpresas = Integer.parseInt(campos[1]);
			melhor = Integer.parseInt(campos[2]);
			int total = 0;
			for (int j=0; j<n; j++){
				int resultado = Integer.parseInt(campos[3 + j]);
				int media = resultado / 3;
				int sobra = resultado % 3;
				if (media >= melhor){
					total++;
				}else if (sobra >= 1 && media + 1 <= 10 && media + 1 >= melhor){
					total++;
				}else if (sobra == 2 && surpresas > 0 && media + 2 <= 10 && media + 2 >= melhor){
					total++;
					surpresas--;
				}else if (media >= 1 && media + 1 <= 10 && surpresas > 0 && media + 1 >= melhor){
					total++;
					surpresas--;					
				}
			}
			bw.write("Case #" + i + ": " + total + "\n");
		}
		br.close();
		bw.close();
	}
}
