package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;

public class GoogleDancers{

	public static void main(String[] args) throws Exception{
		FileReader fr = new FileReader("C:\\java projects\\learn\\src\\B-small-attempt0.in");
		BufferedReader br = new BufferedReader(fr);
		FileWriter fw = new FileWriter("C:\\java projects\\learn\\src\\BLarge.txt");
		int N = new Integer(br.readLine());
		for (int cases = 1; cases <= N; cases++) {
			String str = br.readLine();
			StringTokenizer st = new StringTokenizer(str); 
			int numberParticipants = Integer.parseInt(st.nextToken());
			int surprise = Integer.parseInt(st.nextToken()); 
			int goodScore = Integer.parseInt(st.nextToken());
			int a[] = new int[numberParticipants];
			for(int i=0; i< numberParticipants; i++) {
				a[i] = Integer.parseInt(st.nextToken());
			}
			int count = 0;
			int possibility = 0;
			int minToGetGoodScore = Math.max(((3 * goodScore) - 2), 1);
			System.out.println("minToGetGoodScore" + minToGetGoodScore);
			int surpriseRange = Math.max(((3* goodScore) - 4), 1);
			if (goodScore > 0 ) {
				for (int i = 0; i < numberParticipants; i++) {
					if (a[i] >= minToGetGoodScore) {
						count++;
						System.out.println("Count" + count);
						

					} else if (a[i] >= surpriseRange
							&& a[i] < minToGetGoodScore) {
						possibility++;
					}
				}System.out.println("Count" + count);
				count = count + Math.min(possibility, surprise);
				System.out.println("Count" + count);
			}
			else
			{
				count = numberParticipants;
			}
			fw.write("Case #" + cases + ": " + count + "\n");
			
		}
		fw.flush();
		fw.close();
	}
}
