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

import java.io.*;
import java.util.StringTokenizer;

public class Dancing {

	public Dancing() {
		// TODO Auto-generated constructor stub
	}
	
	
	public static void dancing()throws IOException{
		BufferedReader rdr = new BufferedReader(new FileReader("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter(new FileWriter("B.out"));
        int cases = Integer.parseInt(rdr.readLine());

        for (int i = 0; i < cases; i++) {
			String line = rdr.readLine();
            StringTokenizer st = new StringTokenizer(line);
			int n = Integer.parseInt(st.nextToken());
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			int result = 0;
			
			for(int j=0; j<n; j++){
				int x = Integer.parseInt(st.nextToken());
				if(!(x==0 && p!=0)){
					if(x >= p*3 || x == p*2 + (p-1) || x == p + (p-1)*2){
						result++;
					}
					else{
						if((s>0) && (x == p*2 + (p-2) || x == p + (p-1) +(p-2) || x == p + (p-2)*2 )){
							result++;
							s--;
						}
					}
				}
				
			}
			
			
            pw.println("Case #"+(i+1)+": "+result);
        }
        

        pw.close();
        rdr.close();
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args)throws IOException {
		// TODO Auto-generated method stub
		dancing();
	}

}
