/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	public Scanner sc;
	public Map<Character, Character> mapping = new HashMap<Character, Character>();

	public static void main(String[] args) {
		Main m = new Main();
		m.start();
	}

	public void start() {
		sc = new Scanner(System.in);
		int t = sc.nextInt();
		for (int i = 1; i <= t; i++) {
			System.out.print("Case #" + i + ": ");
			solve();
		}
	}

	public void solve() {
		int ans = 0;
		int n = sc.nextInt();
		int s = sc.nextInt();
		int p = sc.nextInt();
		for (int i = 0; i < n; i++) {
			int t = sc.nextInt();
			if (calcMax(t, false) >= p) {
				ans++;
				continue;
			}

			if (s > 0 && calcMax(t, true) >= p) {
				ans++;
				s--;
				continue;
			}
		}
		System.out.println(ans);
	}

	public int calcMax(int t, boolean suprising) {

		if (t == 0) {
			return 0;
		}

		int max = 0;
		switch (t % 3) {
		case (0):
			max = t / 3;
			if (suprising) {
				max++;
			}
			break;
		case (1):
			max = (int) t / 3 + 1;
			break;
		case (2):
			max = (int) t / 3 + 1;
			if (suprising) {
				max++;
			}
			break;
		}
		return max;
	}
}
