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

import java.io.*;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Ivan du Toit <s29363412>
 */
public class CodeJam2 {
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        BufferedReader fIn = null;
        PrintWriter fOut = null;
        try {
            fIn = new BufferedReader(new FileReader("in.txt"));
            fOut = new PrintWriter(new FileWriter("out.txt"));
            
        } catch (IOException e) {
            System.out.println("Invalid file given for output.");     
            System.exit(200);
        }
        
        Scanner in = new Scanner(fIn);
        int numberOfCases = Integer.parseInt(in.nextLine());
        
        for (int c=0; c<numberOfCases; c++) {
            fOut.print("Case #" + (c+1) + ": ");
            int numGoogs = in.nextInt();
            int numSuprises = in.nextInt();
            int bestScore = in.nextInt();
            int result = 0;
            for (int pos=0; pos<numGoogs; pos++) {
                int total = in.nextInt();
                int num = (int) Math.floor(total/3);
                int res = total % 3;
                //res = (res  > 1) ? 1 : res; 
                //boolean resBiggerThan1 = (res  > 1);
                boolean resLessThan1 = (res < 1);
                if (num >= bestScore)
                    result++;
                else if ((!resLessThan1) && (num + 1 >= bestScore))
                    result++;
                else if ((numSuprises > 0) && (num > 0) && ((resLessThan1 && (num + 1 >= bestScore)) || (!resLessThan1 && (num + res >= bestScore)))) {
                    numSuprises--;
                    result++;
                }
                else if ((numSuprises > 0) && (!resLessThan1 && (num + res >= bestScore))) {
                    numSuprises--;
                    result++;
                }
            }
            in.nextLine();
            fOut.println(result);
        }
        fOut.flush();
    }
    
    
}
