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;
	}

}

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class DanceGoogle {
	public static void main( String[] args ) throws IOException {
		File fileOut = new File( "B-large.out" );
		BufferedWriter writer = new BufferedWriter( new FileWriter(fileOut) );
		Scanner sc = new Scanner( new File ( "B-large.in" ) );
		int count = 0;
		int number = sc.nextInt();
		int caseNumber = number;
		for ( int caseNumberIndex = 0; caseNumberIndex < caseNumber; caseNumberIndex++ ) {
			int numberOfDancer = sc.nextInt();
			int numberOfSuprise = sc.nextInt();
			int bestScore = sc.nextInt();
			int compare = ( bestScore * 3 ) - 2;
			for ( int dancerIndex = 0; dancerIndex < numberOfDancer; dancerIndex++ ) {
				number = sc.nextInt();
				if ( ( number > 28 ) || ( number < 2 ) ) {
					if ( number > 28 )
						count++;
					else if( (number > 0) && (bestScore == 1) )
						count++;						
				}
				else if ( number < compare ) {
					if ( number >= (compare - 2 ) ) {
						if ( numberOfSuprise > 0 ) {
							numberOfSuprise--;
							count++;
						}
					}
				}
				else 
					count++;	
			}
			if ( bestScore == 0 ) 
				count = numberOfDancer;
			writeOutput( writer, count, caseNumberIndex );
			count = 0;
		}
		writer.close();
		sc.close();
	}
	
	private static void writeOutput( BufferedWriter writer, int count, int caseNumber ) throws IOException {		
		writer.append( "Case #" + (caseNumber+1) );		
		writer.append( ": " + count );
		writer.append( "\r\n" );
		
	}
}
