/*
 * 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.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;

public class _Q_B_small {
	public static void main(String[] args) throws Exception {
		String input_file = "B-small-attempt0.in";
		String output_file = "_Q_B_small_out.txt";
		
		BufferedReader in = new BufferedReader(new FileReader(input_file));
		PrintStream out = new PrintStream(new FileOutputStream(output_file));
		
		in.readLine();
		String line;
		int case_num = 1;
		while ((line=in.readLine()) != null) {  
			String[] line_str = line.split(" ");
			int n = Integer.parseInt(line_str[0]);
			int s = Integer.parseInt(line_str[1]);
			int p = Integer.parseInt(line_str[2]);
			int[] t = new int[n];
			for (int i = 0; i < n; ++i)
				t[i] = Integer.parseInt(line_str[i+3]);
			
			int[] base = new int[n];
			int[] remain = new int[n];
			
			for (int i = 0; i < n; ++i) {
				base[i] = t[i]/3;
				remain[i] = t[i]%3;
			}
			
			// Filter by p
			ArrayList<Integer> valid_index = new ArrayList<Integer>();
			for (int i = 0; i < n; ++i) {
				if (base[i] >= p - 1 ||	base[i] + remain[i] >= p)
					valid_index.add(i);
			}
			
			int s_consumed = 0;
			int result = 0;
			for (Integer i : valid_index) {				
				if (remain[i] == 0) {
					if (base[i] < p) {
						if (base[i] > 0 && s_consumed < s) {
							++s_consumed;
							++result;	
						}
					} else {
						++result;
					}
				}
			}
			
			for (Integer i : valid_index) {				
				if (remain[i] == 1) {
					++result;
				} else if (remain[i] == 2){
					if (base[i] < p - 1) {
						if (s_consumed < s) {
							++s_consumed;
							++result;
						}
					} else {				
						++result;
					}
				}
			}
			
			out.println("Case #" + case_num + ": " + result);
			++case_num;
		}
	}
}
