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

public class B {

	public static void main(String[] args) {
		Scanner input = new Scanner( System.in );

		int t = input.nextInt();
		for( int i = 0; i < t; i++ ) {
			int n = input.nextInt();
			int s = input.nextInt();
			int p = input.nextInt();

			int minScore = ( p * 3 ) - 2;
			int minScoreWithS = ( p * 3 ) - 4;

			int result = 0;
			for( int j = 0; j < n; j++ ) {
				int score = input.nextInt();

				if( score >= p ) {
					if( score >= minScore ) {
						result += 1;
					} else if( score >= minScoreWithS && s > 0 ) {
						result += 1;
						--s;
					}
				}
			}

			System.out.println( "Case #" + ( i + 1 ) + ": " + result );
		}
	}

}
