/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}


package gcj;
 
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

/**
 *
 * @author Mervin.Lavin
 */
public class Gcj
{

    public static void main
        (String[] args)
        throws Exception
    {
        doProb2( "B-small-attempt0.in", "output.txt" );
    }
    
    private static void doProb2
        ( String inputFileName, String outputFileName )
        throws Exception
    {
        File inputFile = new File( inputFileName );
        Scanner scanner = null;
        scanner = new Scanner( inputFile );
        File outputFile = new File( outputFileName );
        BufferedWriter output = new BufferedWriter( new FileWriter( outputFile ) );
        
        int contestants, surpriseScores, minBestScore;
        int totalScore, aveScore, passedContestants;
        int testCases = scanner.nextInt();
        for ( int caseNum = 1; caseNum <= testCases; caseNum++ )
        {
          contestants = scanner.nextInt();
          surpriseScores = scanner.nextInt();
          minBestScore = scanner.nextInt();
          passedContestants = 0;
          for ( int contestant = 0; contestant < contestants; contestant++ )
          {
            totalScore = scanner.nextInt();
            aveScore = totalScore / 3;
            switch ( totalScore % 3 )
            {
                case 0:
                    if ( aveScore >= minBestScore )
                    {
                        passedContestants++;
                    }
                    else if ( ( surpriseScores > 0 )
                        && ( ( aveScore + 1 ) >= minBestScore ) 
                        && ( ( aveScore + 1 ) <= totalScore ))
                    {
                        passedContestants++;
                        surpriseScores--;
                    }
                    break;
                case 1:
                    if ( ( aveScore + 1 ) >= minBestScore )
                    {
                        passedContestants++;
                    }
                    break;
                case 2:
                    if ( ( aveScore + 1 ) >= minBestScore )
                    {
                        passedContestants++;
                    }
                    else if ( ( surpriseScores > 0 )
                        && ( ( aveScore + 2 ) >= minBestScore )
                        && ( ( aveScore + 2 ) <= totalScore ) )
                    {
                        passedContestants++;
                        surpriseScores--;
                    }
                    break;
            }
          }          
          output.append( "Case #" + caseNum + ": " + passedContestants );
          output.newLine();
        }
        scanner.close();
        output.close();
    }
}
