/*
 * 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 gjc.googledancer;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;

public class Solution {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("B-small-attempt0.txt"));
		int nTestCases = Integer.parseInt(br.readLine());
		for (int i=0; i<nTestCases; i++) {
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line);
			int nDancer = Integer.parseInt(st.nextToken());
			int nSurprise = Integer.parseInt(st.nextToken());
			int threshold = Integer.parseInt(st.nextToken());

			int result = 0;
			for (int j=0; j<nDancer; j++) {
				int totalValue = Integer.parseInt(st.nextToken());
				int stdValue = 0, surpriseValue = 0;
				if (totalValue%3==0) {
					stdValue = totalValue/3;
					if (totalValue==0 || totalValue==30) {
						surpriseValue = stdValue;
					} else {
						surpriseValue = totalValue/3 + 1;
					}
				} else if (totalValue%3==1) {
					stdValue = totalValue/3 + 1;
					surpriseValue = totalValue/3 + 1;
				} else if (totalValue%3==2) {
					stdValue = totalValue/3+1;
					if (totalValue==29) {
						surpriseValue = stdValue;
					} else {
						surpriseValue = totalValue/3 + 2;
					}
				}
				
				if (stdValue>=threshold) {
					result++;
				} else if (surpriseValue>=threshold && nSurprise>0) {
					result++;
					nSurprise--;
				}
			}
			
			// Display the results.
			bw.write("Case #"+(i+1)+": ");
			bw.write(result+"\n");
		}
		bw.close();
	}

}
