import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}


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