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;
	}

}

/**
 * 
 */
package google.exercise.b;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

/**
 * @author tomtom
 * 
 */
public class B {

    private static Scanner in;
    private static PrintWriter out;
    private static int nbCase;

    private static class Solver {

	private int currentNbMax;
	private int currentNbMin;
	private int treshold;
	private int nbGooglers;
	private List<Integer> scores;
	private int nbSurprise;

	public void solve() {
	    for (int i = 1; i <= nbCase; i++) {
		out.printf("Case #%d: %s%n", i, doSolve());
		in.nextLine();
	    }
	}

	private int doSolve() {
	    int nbGoodScorer = 0;
	    scores = new ArrayList<Integer>();
	    nbGooglers = in.nextInt();
	    nbSurprise = in.nextInt();
	    treshold = in.nextInt();
	    currentNbMax = treshold * 3 - 2;
	    currentNbMin = ((treshold - 2) < 0 ? 0 : treshold - 2) * 2
		    + treshold;

	    for (int i = 0; i < nbGooglers; i++) {
		scores.add(in.nextInt());
	    }

	    Collections.sort(scores);
	    Collections.reverse(scores);

	    for (Integer score : scores) {
		if (score >= currentNbMax) {
		    nbGoodScorer++;
		} else if (score < currentNbMax && score >= (currentNbMax - 2)) {
		    if (nbSurprise > 0) {
			nbSurprise--;
			if (score >= treshold) {
			    nbGoodScorer++;
			}
		    }
		}
	    }

	    return nbGoodScorer;
	}

    }

    /**
     * @param args
     * @throws FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
	in = new Scanner(new File(
		"/Users/tomtom/Desktop/jam-2012/input-B/B-large.in"));
	out = new PrintWriter(new FileOutputStream(
		"/Users/tomtom/Desktop/jam-2012/input-B/B-large.out"));

	nbCase = in.nextInt();
	in.nextLine();

	new Solver().solve();

	in.close();
	out.close();
    }
}
