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.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWiththeGooglers {

	public static void main ( String [] arg ) throws IOException{
		BufferedReader reader = new BufferedReader(new FileReader(new File("input")));
		PrintWriter output = new PrintWriter(new File("output"));
		int cases = Integer.valueOf( reader.readLine() ); 
		for ( int i=1; i<=cases; i++ ){
			StringTokenizer tkn = new StringTokenizer( reader.readLine() ); 
			int N = Integer.valueOf( tkn.nextToken() ); 
			int S = Integer.valueOf( tkn.nextToken() ); 
			int p = Integer.valueOf( tkn.nextToken() ); 
			int sol=0; 
			for ( int j=0; j<N; j++){
				int points = Integer.valueOf( tkn.nextToken() ); 
				if ( ok(points,p,3) ){
					sol++;
				} else {
					if ( S>0 && ok(points,p,4) ){
						sol++;
						S--;
					}
				}
			}
			output.println("Case #"+i+": " + sol ); 
		}
		output.close(); 
	}
	
	public static boolean ok( int suma, int p, int sum_delta ){
		for ( int i=0; i<=10; i++ ){
			for ( int j=0; j<=10; j++ ){
				for ( int k=0; k<=10; k++ ){
					if ( i+j+k == suma ){
						int unu =  Math.abs(i-j);
						int doi =  Math.abs(i-k);
						int trei = Math.abs(j-k);
						if ( unu+doi+trei<=sum_delta ){
							if ( Math.max( Math.max(i, j), k )>=p){
								return true; 
							}
						}
					}
				}
			}
		}
		return false; 
	}
	
}
