import java.util.Scanner;
import java.io.*;
class dance
{
  public static void main (String[] args) throws IOException
  { 
    File    inputData = new File("B-small-attempt0.in");
	File 	outputData= new File("Boutput.txt");
    Scanner scan = new Scanner( inputData );
	PrintStream print= new PrintStream(outputData);
    
	int t;
	int n,s,p,pi;
	t= scan.nextInt();
	for(int i=1;i<=t;i++)
	{
	n=scan.nextInt();	s=scan.nextInt();	p=scan.nextInt();
	int supTrip=0, notsupTrip=0;
	
	for(int j=0;j<n;j++)
	{
		pi=scan.nextInt();
		if(pi>(3*p-3))
		notsupTrip++;
		else if((pi>=(3*p-4))&&(pi<=(3*p-3))&&(pi>p))
		supTrip++;
	}
	
	if(s<=supTrip)
	notsupTrip=notsupTrip+s;
	else if(s>supTrip)
	notsupTrip= notsupTrip+supTrip;
	print.println("Case #"+i+": "+notsupTrip);
	}
  }
}
package com.google.code;

import java.io.IOException;

public class B extends GCJ {

	protected B() throws IOException {
		super();
	}

	@Override
	protected void code(int count) throws IOException {
		readLine();
		int N = getIntInput(0);
		int S = getIntInput(1);
		int p = getIntInput(2);
		
		int limitForOrdinary = p + (p - 1 < 0 ? p : p - 1) * 2;
		int result = 0;
		for (int i = 0; i < N; i++) {
			int googler = getIntInput(3 + i);
			if (googler>= limitForOrdinary) {
				result ++;
				continue;
			}
			if (S>0)
				if (googler>1 && googler+2 >=limitForOrdinary) {
					S--;
					result++;
					continue;
				}			
		}
		writeln(result);
	}
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		new B().run();
}
}
