import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

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