/*
 * 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.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Dancing {

	public static void main(String[] s){
		doIt();
	}

	private static void doIt() {
		Scanner s=null;
		try {s = new Scanner(new File("B-small-attempt0.in"));}
		catch (FileNotFoundException e) {e.printStackTrace();}
		
		PrintWriter out=null;
		try {out = new PrintWriter(new FileWriter("a.out"));} 
		catch (IOException e) {e.printStackTrace();}
		
		int cases=s.nextInt();
		
		for(int idx=0;idx<cases;idx++){
			int number=s.nextInt();
			int surprising=s.nextInt();
			int targetScore=s.nextInt();
			int valid=0;
			for(int idy=0;idy<number;idy++){
				int current=s.nextInt();
				
				if(current%3==0 && current/3>=targetScore) valid++;
				else if(current%3!=0 && current/3+1>=targetScore) valid++;

				else if(surprising>0 && current/3+1==targetScore  && current>1){
					surprising--;
					valid++;
				} 
				else if(surprising>0 && current%3==2 && current/3+2==targetScore){
					surprising--;
					valid++;
				} 
				
			}
			
			int index=idx+1;
			out.println
			("Case #"+index+": "+valid);
		}
		
		
		out.close();
	}
}
