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.util.*;

public class DancingWithGooglers {
	public static void main( String[] args ) {
	    Scanner in = new Scanner( System.in );
	    int T = in.nextInt();
	    
	    for( int z = 1; z <= T; z++ ) {
	    	int N = in.nextInt();
	    	int S = in.nextInt();
	    	int p = in.nextInt();
	    	
	    	int count = 0;
	    	
	    	for( int i = 0; i < N; i++ ) {
	    		int sum = in.nextInt();
	    		int avg = sum / 3;
	    		
	    		if( Math.ceil( sum / 3.0 ) >= p ) {
	    			count++;
	    		} else if( S > 0 ) {
	    			boolean flag = false;
	    			
	    			for( int a = 0; a <= 10; a++ ) {
	    				for( int b = 0; b <= 10; b++ ) {
	    					int c = sum - a - b;
	    					
	    					if( c < 0 || c > 10 || max3( a, b, c )-min3( a, b, c ) > 2 ) {
	    						continue;
	    					}
	    					
	    					if( max3( a, b, c ) >= p ) {
		    					S--;
		    					count++;
		    					flag = true;
		    					break;
	    					}
		    			}
	    				
	    				if( flag ) {
	    					break;
	    				}
	    			}
	    		}
	    	}
	    	
	    	System.out.println( "Case #" + z + ": " + count );
	    }
    }
	
	public static int max3( int a, int b, int c ) {
		return Math.max( a, Math.max( b, c ) );
	}
	
	public static int min3( int a, int b, int c ) {
		return Math.min( a, Math.min( b, c ) );
	}
}
