import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;


public class GooglersDancer {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		InputStreamReader converter = new InputStreamReader(System.in);
		BufferedReader in = new BufferedReader(converter);
		if (in == null) {
		      return;
		    }
		String numTest = in.readLine();
		int maxCases = Integer.valueOf(numTest);
		for(int i=1;i<= maxCases;i++){
			String linea = in.readLine();
			String[] datos = linea.split(" ");
			Integer googlers = Integer.valueOf(datos[0]);
			Integer sospechosos = Integer.valueOf(datos[1]);
			Integer p = Integer.valueOf(datos[2]);
			Integer puntuacion;
			Integer personas = 0;
			ArrayList<Integer> puntuaciones = new ArrayList<Integer>();
			for(int j=0;j<googlers;j++){
				puntuacion = Integer.valueOf(datos[3+j]);
				puntuaciones.add(puntuacion);
			}
			Integer[] pOrdenado = null;
			pOrdenado = (Integer[]) puntuaciones.toArray(new Integer[puntuaciones.size()]);
			Arrays.sort(pOrdenado);
			int j;
			for(j=pOrdenado.length-1;j>=0;j--){
				if(pOrdenado[j] >= p*3-2){
					personas += 1;
				}else{
					break;
				}
			}
			int posibles = j+1-sospechosos;
			for(;j>=posibles && j>= 0;j--){
				if(pOrdenado[j] >= p*3-4 && pOrdenado[j] > p){
					personas += 1;
				}else{
					break;
				}
			}
			System.out.println("Case #"+i+": "+personas);
		}
	}

}

package com.googlecode.codejam.contest.gcj2012.round_q;

import java.util.Arrays;
import java.util.Iterator;
import java.util.concurrent.Callable;

import com.googlecode.codejam.model.JamCaseResolver;
import com.googlecode.codejam.model.JamCaseResolverFactory;
import com.googlecode.codejam.model.JamResolver;

public class B extends JamCaseResolver {

	private final int s; // surprising
	private final int p; // score limit
	
	private final int[] scores;
	
	public B(final int caseNumber, final Iterator<String> lineIterator) {
		super(caseNumber);
		int[] input = this.parseInt(lineIterator.next().split(" "));
		s = input[1];
		p = input[2];
		scores = Arrays.copyOfRange(input, 3, input.length);
	}
	
	@Override
	protected String resolve() {
		int surprisingUsed = s;
		int result = 0;
		for (int score : scores) {
			if(score < 2) {
				if(score >= p)
					result++;
				continue;
			}
			double avg = Math.ceil(score / 3.0);
			
			if(avg >= p) {
				result++;
			} else if (surprisingUsed > 0 && avg + 1 >= p && (score - 1) % 3 != 0) {
				result++;
				surprisingUsed--;
			}
		}
		return String.valueOf(result);
	}

	public static void main(String[] args) throws Exception {
		final JamCaseResolverFactory factory = new JamCaseResolverFactory() {
			@Override
			public Callable<String> newJamCaseResolver(int caseNumber, Iterator<String> lineIterator) {
				return new B(caseNumber, lineIterator);
			}
		};
		final JamResolver jamResolver = new JamResolver(factory, "gcj2012/round_q", "B-large.in");
		jamResolver.resolve();
	}

}
