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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class DancingWithGooglers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		Scanner in;
		in = new Scanner(new FileReader("B-small.in"));
		FileWriter output = new FileWriter("B-small.out");
		
		int T = in.nextInt();
		
		for(int i = 1; i <= T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int pass = 0;
			
			for(int j = 1; j <= N; j++) {
				int x = in.nextInt();
				if(p > x) continue;
				int remaining = x-p;
				if( (remaining/2) >= (p-1) ) {
					pass++;
				} else if ( ( (remaining/2) == (p-2) ) && (S > 0) ) {
					pass++;
					S--;
				}
			}
			
			output.write("Case #" + i + ": " + pass + "\n");
		}
		
		in.close();
		output.flush();
		output.close();

	}

}
