package com.gcj.parser;

public class MaxPoints {

	public static int normal(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 1 ; break;
		case 3 : toReturn = 1 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 2 ; break;
		case 6 : toReturn = 2 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 3 ; break;
		case 9 : toReturn = 3 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 4 ; break;
		case 12 : toReturn = 4 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 5 ; break;
		case 15 : toReturn = 5 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 6 ; break;
		case 18 : toReturn = 6 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 7 ; break;
		case 21 : toReturn = 7 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 8 ; break;
		case 24 : toReturn = 8 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 9 ; break;
		case 27 : toReturn = 9 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}

		return toReturn;
	}

	public static int surprising(int value){
		int toReturn = 0;
		switch (value) {
		case 0 : toReturn = 0 ; break;
		case 1 : toReturn = 1 ; break;
		case 2 : toReturn = 2 ; break;
		case 3 : toReturn = 2 ; break;
		case 4 : toReturn = 2 ; break;
		case 5 : toReturn = 3 ; break;
		case 6 : toReturn = 3 ; break;
		case 7 : toReturn = 3 ; break;
		case 8 : toReturn = 4 ; break;
		case 9 : toReturn = 4 ; break;
		case 10 : toReturn = 4 ; break;
		case 11 : toReturn = 5 ; break;
		case 12 : toReturn = 5 ; break;
		case 13 : toReturn = 5 ; break;
		case 14 : toReturn = 6 ; break;
		case 15 : toReturn = 6 ; break;
		case 16 : toReturn = 6 ; break;
		case 17 : toReturn = 7 ; break;
		case 18 : toReturn = 7 ; break;
		case 19 : toReturn = 7 ; break;
		case 20 : toReturn = 8 ; break;
		case 21 : toReturn = 8 ; break;
		case 22 : toReturn = 8 ; break;
		case 23 : toReturn = 9 ; break;
		case 24 : toReturn = 9 ; break;
		case 25 : toReturn = 9 ; break;
		case 26 : toReturn = 10 ; break;
		case 27 : toReturn = 10 ; break;
		case 28 : toReturn = 10 ; break;
		case 29 : toReturn = 10 ; break;
		case 30 : toReturn = 10 ; break;

		}
		return toReturn;
	}

}

package codejam;

import java.io.*;
import java.util.*;

public class test {

	public static void main(String[] args) {

        try{
        	
	        int googlers=0;
	        int surprises=0;
	        double bestResult=0;
	        double score=0;
	        int possible=0;
	        
	
	
	        BufferedReader f = new BufferedReader(new FileReader("X:/programacion/codejam/2012/1B/B-large.in"));
	        PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("X:/programacion/codejam/2012/1B/B-large.out")));

	        StringTokenizer st1 = new StringTokenizer(f.readLine());
	
	        long numCasosDePrueba=Integer.parseInt(st1.nextToken());
	
	        for (int i=1;i<=numCasosDePrueba;i++){
	            st1 = new StringTokenizer(f.readLine());
	            googlers = Integer.parseInt(st1.nextToken());
	            surprises = Integer.parseInt(st1.nextToken());
	            bestResult = Double.parseDouble(st1.nextToken());
	            possible=0;
	
	            for(int j=1;j<=googlers;j++){
	            	score=Double.parseDouble(st1.nextToken());
	            	score=score-bestResult;
	            	if(score>=0){
	                	if(bestResult-(score/2)<=1) possible++;
	                	else{
	                		if (surprises>0){
	                			if(bestResult-(score/2)<=2){
	                				possible++;
	                				surprises--;
	                			}
	                		}
	                	}
	            	}
	            }
	
	            out.print("Case #"+i+": "+possible);
	            if (i!=numCasosDePrueba) out.println();
	            
	        }
        out.close();
        System.exit(0);
    }
    catch(Exception e){
        System.out.println(e.getMessage());
    }

    }

}
