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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;


public class B {
	static File inFile = new File("inQBsmall.txt");
	static File outFile = new File("outQBsmall.txt");
	static BufferedReader in;
	static BufferedWriter out;
	static Scanner sc;

	static int T = 0;
	
	
	public static void solve() throws IOException{
		T = sc.nextInt();
		for (int i=0;i<T;i++) {						

			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();

			int res = 0;
			
			for (int j=0;j<N;j++) {
				int g = sc.nextInt();
				if (p==0) {
					res++;					
				} else if (p==1) {
					if (g>=1) res++;
				}
				else if (g>=p+(p-1)+(p-1)) res++;				
				else if (S>0 && g>=p+(p-2)+(p-2)) {
					res++;
					S--;
				}
			}
			

			//StringBuffer res = new StringBuffer();

			//System.out.println(res.toString());
			out.write("Case #"+(i+1)+": "+String.valueOf(res)+"\n");
		}
	}
	
	public static void main(String[] args) throws IOException {
		try {
			in = new BufferedReader(new FileReader(inFile));
			out = new BufferedWriter(new FileWriter(outFile));
			sc = new Scanner(in);
			solve();
		} catch (Exception e) {
			e.printStackTrace();
		} finally {
			in.close();
			out.close();		
		}		

	}
}

