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

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

public class B_dancing_with_the_googlers {

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

		BufferedReader reader = null;
		BufferedWriter writer = null;
		
		try {
			reader = new BufferedReader(new FileReader("./input"));
			writer = new BufferedWriter(new FileWriter("output"));
			int numberOfCases = Integer.valueOf(reader.readLine());
			for (int i = 1; i <= numberOfCases; i++) {
				String line = reader.readLine();
				StringBuilder sb = new StringBuilder("Case #" + i + ": ");
				Scanner scanner = new Scanner(line);
				int result = 0;
				while(scanner.hasNextInt()) {
					int numberOfGooglers = scanner.nextInt();
					int numberOfSurprisings = scanner.nextInt();
					int scoreToReach = scanner.nextInt();
					
					while(numberOfGooglers>0) {
						int googlerScore = scanner.nextInt();
						int div = googlerScore/3;
						int mod =( googlerScore % 3 == 0) ? 0 : 1;
						int highest =  div + mod;
						if(highest>=scoreToReach) {
							result++;
						}
						else if(googlerScore > 0 && highest+1 == scoreToReach && numberOfSurprisings > 0) {
							result++;
							numberOfSurprisings--;
						}
						numberOfGooglers--;
					}
					sb.append(result);
				}
				sb.append("\n");
				writer.write(sb.toString());
			}
		} finally {
			if (reader != null) {
				reader.close();
			}
			if(writer!=null) {
				writer.flush();
				writer.close();
			}
		}
	}

	
}
