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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Arrays;

public class MainProcess {

	/**
	 * @param args
	 */
	
	private Googler[] googlers ;
	
	public MainProcess(File f){
		readFile(f);
	}
	
	private void readFile(File f){
		
		int numCase = 0;
		int numGoogler = 0;
		int numSurprising = 0;
		int p = 0;
		
		try {
			FileReader fr = new FileReader(f);
			BufferedReader br = new BufferedReader(fr);
			
			String str = "";
			
			if( (str = br.readLine())!=null){
				numCase = Integer.parseInt(str);
			}
			
			int count = 0;
			while( count < numCase){
				str = br.readLine();
				String[] substr = str.split(" ");
				
				numGoogler = Integer.parseInt(substr[0]);
				googlers = new Googler[numGoogler];
								
				numSurprising = Integer.parseInt(substr[1]);
				
				p = Integer.parseInt(substr[2]);
				
				for(int i=0 ; i< numGoogler ; i++){
					
					int totalScore = Integer.parseInt(substr[i+3]);
					googlers[i] = new Googler(totalScore);
				}
				
				Arrays.sort(googlers);
				findMaxNum(count ,numSurprising , p);
				
				count++;
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
	}
	
	private void findMaxNum(int count , int numSurprising , int p){
		int numMax = 0;
		
		for(int i=0 ; i< googlers.length ; i++){
			if(numSurprising >0){
								
				int maxScore = googlers[i].getMax(true);
				if(maxScore >= p ){
					numMax++;
					numSurprising--;
				}
			}
			else{
				int maxScore = googlers[i].getMax(false);
				if(maxScore >= p ){
					numMax++;
				}
			}
		}
		
		System.out.println("Case #" + (count+1) + ": " + numMax);
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		File f = new File(".\\src\\DancingWithGooglers\\B-small-attempt2.in");
		MainProcess m = new MainProcess(f);
	}

}
