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

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

public class B_2012 {

	public static void main(String[] args) throws IOException {
		

		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("test2.out")));
		
		int NS[] = {0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10};
		int S[] = {-1,-1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,-1,-1};
		
		int cases= in.nextInt();
		
		for(int c=0;c<cases;c++){
			int n = in.nextInt();
			int s = in.nextInt();
			int b = in.nextInt();	
			int C=0;
			ArrayList<Integer>  G = new ArrayList<Integer>();
					
			for(int i=0;i<n;i++) G.add(in.nextInt());
			Collections.sort(G);
			for(int i=0;i<G.size();i++){
				if(s>0 && S[G.get(i)]>=b) {
					s--;
					G.remove(i);
					C++;
					i--;
				}
			}
			for(int i=0;i<G.size();i++){
				if(s>0 && NS[G.get(i)]<b && S[G.get(i)]<b ) {
					s--;
					G.remove(i);
					i--;
				}
			}
			for(int i=0;i<G.size();i++)
				if(NS[G.get(i)]>=b ) C++;
			
			out.println("Case #"+(c+1)+": "+C);
			
		}
		out.close();
		System.exit(0);
	}
}
