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.codejam2012.qualificationround;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;

public class B {

	public static int nTest;
	public static int nGoogler;
	public static int nSurprise;
	public static int threshold;
	public static int[] scores;
	public static int nHaveHighScore;
	public static int maxScore;
	public static void main(String[] args) throws IOException {
		Scanner scanner = new Scanner(new File("input.txt"));
		FileWriter writer = new FileWriter(new File("output.txt"));
		
		nTest = scanner.nextInt();
		
		for (int i=1;i<=nTest;++i) {
			nHaveHighScore = 0;
			nGoogler = scanner.nextInt();
			nSurprise = scanner.nextInt();
			threshold = scanner.nextInt();
			scores = new int[nGoogler];
			for (int j=0;j<nGoogler;++j) {
				scores[j] = scanner.nextInt();
				
				if (scores[j] % 3 == 0) {
					maxScore = scores[j] / 3;
					if (maxScore >= threshold) {
						nHaveHighScore++;
					}
					else if (nSurprise > 0 && maxScore+1 >= threshold && maxScore-1 >= 0) {
						nHaveHighScore++;
						nSurprise--;
					}
				}
				else if (scores[j] % 3 == 1) {
					maxScore = scores[j] / 3 + 1;
					if (maxScore >= threshold) {
						nHaveHighScore++;
					}
				}
				else if (scores[j] % 3 == 2) {
					maxScore = scores[j] / 3 + 1;
					if (maxScore >= threshold) {
						nHaveHighScore++;
					}
					else if (nSurprise > 0 && maxScore+1 >= threshold && maxScore-1 >= 0) {
						nHaveHighScore++;
						nSurprise--;
					}
				}
			}
			writer.write("Case #" + i + ": " + nHaveHighScore);
			if (i < nTest) {
				writer.write("\n");
			}
			writer.flush();
		}		
		writer.close();
	}
}
