/*
 * 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 com.google.codejam;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class GooglerDanceSolver {

	public static int getMaximumPassCount(int passScore, int surpriseCount, List<Integer> scores) {
		int passCount = 0;

		int lowerBound = (passScore > 1) ? 3 * passScore - 4 : passScore;
		
		for (int score : scores) {
			if (score < lowerBound) {
				continue;
			} else if (score > 3 * passScore - 3) {
				passCount++;
			} else if (surpriseCount > 0) {
				passCount++;
				surpriseCount--;
			}
		}
		
		return passCount;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int totalCount = Integer.parseInt(scanner.nextLine());
		
		for (int i = 0; i < totalCount; i++) {
			String[] inputs = scanner.nextLine().split(" ");
			int n = Integer.parseInt(inputs[0]);
			int s = Integer.parseInt(inputs[1]);
			int p = Integer.parseInt(inputs[2]);
			List<Integer> scores = new ArrayList<Integer>(n);
			for (int j = 0; j < n; j++) {
				scores.add(Integer.parseInt(inputs[j+3]));
			}
			int answer = GooglerDanceSolver.getMaximumPassCount(p, s, scores);
			System.out.printf("Case #%d: %d%n", i+1, answer);
			//System.err.printf("[Debug Info] p=%d, s=%d, scores=%s%n", p, s, scores.toString());
		}
	}

}
