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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;

import common.FileTranslatorBasis;


public class B {
	
	int allOkLine;
	int surprisingOkLine;
	
	int allOkcount = 0;
	int surprisingOkcount = 0;
	
	int s;
	public void setS(int s){
		this.s = s;
	}
	public void setP(int p){
		allOkLine = p*3-2;
		surprisingOkLine = p*3-4;
		if(surprisingOkLine<=0){
			surprisingOkLine = 1;
		}
	}
	
	public void setT(int t){
		if(t>=allOkLine)
			allOkcount++;
		else if (t>=surprisingOkLine)
			surprisingOkcount++;
		
	}
	
	public int getAns(){
		int surprise = surprisingOkcount > s ? s : surprisingOkcount;
		return surprise + allOkcount;
	}
	
	
	public static void main(String[] args) throws FileNotFoundException {

		System.setOut(new PrintStream(new File("output.txt")));

		String fname = "B-small-attempt0.in.txt";
//		String fname = "B-large-attempt0.in.txt";
		FileTranslatorBasis ftb = FileTranslatorBasis.getInstance(fname);

		int num = ftb.getNumOfCase();
		for (int i = 0; i < num; i++) {
			int[] input = ftb.getIntDataArray();
			B b = new B();
			b.setS(input[1]);
			b.setP(input[2]);
			for(int j=0;j<input[0];j++){
				b.setT(input[j+3]);
			}
			System.out.println("Case #" + Integer.toString(i + 1) + ": "
					+ String.valueOf(b.getAns()));

		}

	}
	
}
