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

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

public class B {
	static int surprise=0;
	static int[] findMin(int[] a)
	{
		for(int i=0;i<a.length-1;i++)
			for(int j=i+1;j<a.length;j++)
			if(a[i]>a[j])
			{
				int t=a[i];
				a[i]=a[j];
				a[j]=t;
			}
		
		return a;
				
	}
	
	static boolean checkTriplet(int a, int b, int c, int maxScore)
	{
		if(Math.abs(a-b)>2 || Math.abs(a-c)>2 || Math.abs(b-c)>2)
			return false;
		if(Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(b-c)==2)
			if((a>=maxScore || b>=maxScore || c>=maxScore) && surprise>0)
			{
				surprise--;
				return true;
			}
			else return false;
		if(a>=maxScore || b>=maxScore || c>=maxScore)
			return true;
		return false;
		
		
	}
	public static void main(String args[]) throws FileNotFoundException
	{
		Scanner sin=new Scanner(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\B-small-attempt1.in"));
		PrintStream ps=new PrintStream(new File("C:\\Users\\DELL\\Desktop\\CodeJam\\BOut.out"));
		int cases=sin.nextInt();
		for(int i=1;i<=cases;i++)
		{
			int num=sin.nextInt();
			surprise=sin.nextInt();
			int maxScore=sin.nextInt();
			int count=0;
			int[] scores=new int[num];
			for(int j=0;j<num;j++)
				scores[j]=sin.nextInt();
			
			scores=findMin(scores);
			
			for(int j=0;j<scores.length;j++)
			{
				//System.out.println(" for "+scores[j]);
				if(maxScore>scores[j])
					continue;
				int div=scores[j]/3;
				int rem=scores[j]-div;
				if(rem<maxScore)
					continue;
				if(checkTriplet(div,rem/2,rem-rem/2, maxScore))
				{
					//System.out.println("check pass for "+div+" "+rem/2+" "+(rem-rem/2));
					count++;
				}
				else if(checkTriplet(div,maxScore,rem-maxScore,maxScore))
				{
					count++;
				}
			}
			
			ps.println("Case #"+i+": "+count);
			
		}
		ps.close();
	}

}
