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

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class DancingWithTheGooglers {

	private String solve(Scanner in) {
		int N = in.nextInt();
		int S = in.nextInt();
		int p = in.nextInt();
		
		int p3 = 3*p;
		
		if (p >10) return "" + 0;
		
		int result = 0;
		int strange = 0;

		for (int i=0; i<N; i++) {
			int score = in.nextInt();

			if (p3 <= score) result++;
			else {	
				int diff = p3 - score;
				if (diff <= 2) {
					if (p - 1 >= 0)
						result++;
				}
				else if (diff <= 4) {
					if (p - 2 >= 0) {
						strange++;
						if (strange <= S) result++;
					}
				}
			}
			
		}
		
		return "" + result;
	}
	
	
	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
	    Scanner in = new Scanner(new File("C:\\Users\\User\\Desktop\\dane\\data.in"));
	    PrintWriter out = new PrintWriter("C:\\Users\\User\\Desktop\\dane\\output");
		
	    int T = in.nextInt();
	    in.nextLine();
	
        for (int i = 0; i < T; i++) {
            String s = "Case #" + (i + 1) + ": " + new DancingWithTheGooglers().solve(in);
            out.println(s);
            System.out.println(s);
        }
        out.close();

	}

}
