/*
 * 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 codejam2012.B;

import java.io.File;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 *
 * @author Rymbu VV
 */
public class DancingWithGooglers {

    private Scanner sc;
    private PrintWriter pw;
    private int CASES;
    
    public static void main(String[] args) {
        DancingWithGooglers suk = new DancingWithGooglers("c:\\b.in", "c:\\b.out");
        suk.execute();
    }
    
    public DancingWithGooglers(String fileIn, String fileOut) {
        try{
            sc = new Scanner(new File(fileIn));
            pw = new PrintWriter(new FileWriter(fileOut));
            CASES = sc.nextInt();
        }catch(Exception e){System.out.println("In Constructor "+e);}
    }
    
    public void execute(){
        int N, S, p, count;
        for(int ncase = 1; ncase <= CASES; ncase++){
            pw.print("Case #"+ncase+": ");
            
            N = sc.nextInt();
            S = sc.nextInt();
            p = sc.nextInt();
            count = 0;
            for (int i=0; i<N; i++){
                int t = sc.nextInt();
                if (t>=p && (t/3) >= p ){
                    count++;
                    continue;
                }
                int tmp = t-p;
                if (t>=p && (p-(tmp/2)) <= 1){
                    count++;
                    continue;
                }
                if (S>0 && t>=p && (p-(tmp/2)) <= 2){
                    count++;
                    S--;
                }
            }
            
            pw.println(count);
        }
        pw.flush();
        pw.close();
        sc.close();
    }
}
