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.google.codejam;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class GoogleDance2 {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new BufferedReader(new FileReader("/Users/sunny/Desktop/B-small-attempt0.in")));
		PrintWriter out=new PrintWriter(new FileWriter("/Users/sunny/Desktop/B-small.out"));
		int t = in.nextInt(); int n, s, p ; String line;   
		for( int i = 1 ; i <= t ; i++){
			n = in.nextInt() ; s = in.nextInt() ; p = in.nextInt() ;
			int []scores = new int[n];
			for(int j = 0 ; j < n ; j++) {
				scores[j] = in.nextInt() ; 
			}
			line = "Case #"+i+": "+findMax(n, s, p, scores);
			System.out.println(line);
			out.println(line);
		}
		out.close() ;
	}

	private static int findMax(int n, int s, int p, int[] scores) {
		int d ;
		List<Combination> c= new ArrayList<Combination>();
		boolean gp = true, surp = true; 
		for(int i = 0 ; i < n ; i++) {
			d = scores[i]/3 ; 
			switch (scores[i]%3) {
			case 0 : 
				if(d>=p) {
					c.add(new Combination(gp, !surp));
				}
				else if (d+1 >=p && d-1>=0){
					c.add(new Combination(gp, surp));
				}
				else {
					c.add(new Combination(!gp,!surp));
				}
				break ; 
			case 1 :
				c.add(new Combination(d+1>=p, !surp));
				break ; 
			case 2 :
				if(d+1 >=p) {
					c.add(new Combination(gp, !surp));
				}
				else if (d+2 >=p) {
					c.add(new Combination(gp, surp));
				}
				else {
					c.add(new Combination(!gp, !surp));
				}
				break ;
			}
		}
		
		return colAlgo(c, n, s);
	}

	private static int colAlgo(List<Combination> cs, int n, int s) {
		int count = 0 ; 
		Combination c ; 
		for(int i = 0 ; i < n ; i++) {
			c = cs.get(i);
			if(c.gp){
				if(c.sur) {
					if(s>0){
						s--;
						count++ ;						
					}
				}
				else{
					count++ ; 
				} 
			}
		}
		return count;
	}

	private static class Combination {
		public Combination(boolean gp, boolean surp) { 
			this.gp = gp ; 
			this.sur = surp ;			
		}
		boolean sur ; 
		boolean gp ; 
	}
}
