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 de.pat.dev.y2012.qualification.b;

import java.util.Arrays;
import java.util.Collections;

/**
 * @author pat.dev@alice.de
 */
public class ScoreStatistics {
  private final int numberOfSurprises;
  private final int[] scores;

  public ScoreStatistics(int numberOfSurprises, int[] scores) {
    this.numberOfSurprises = numberOfSurprises;
    this.scores = scores;Arrays.sort(scores);
  }

  public int numberOfGooglersReaching(int bestScore) {
    final int bestScoreSum=3*bestScore;
    int numberOfSuccessfulGooglers=0;
    int surprises=numberOfSurprises;

    for (int i=scores.length-1;i>=0;i--) {
      int diff = scores[i]-bestScoreSum;
      if (diff >= -2) { // e.g. : t=13, p=5 => t=4+4+5, diff=-t-3*p=13-3*5=-2
        numberOfSuccessfulGooglers++;
      } else { // diff < -2
        if (surprises>0 && diff >= -4 && scores[i]>0) { // -4 <= diff < -2, e.g.: t=11, p=5 => t=3+5+3=11, diff=11-15=-4
          numberOfSuccessfulGooglers++;
          surprises--;
        } else break;
      }
    }
    return numberOfSuccessfulGooglers;
  }

  @Override
  public String toString() {
    return "ScoreStatistics{" +
      "numberOfSurprises=" + numberOfSurprises +
      ", scores=" + Arrays.toString(scores) +
      '}';
  }
}
