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


public class DancingWithTheGooglers {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub

		BufferedReader reader = new BufferedReader(new FileReader(new File("B-small-attempt0.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("out")));
		
		int T = Integer.parseInt(reader.readLine());
		
		for(int i = 0;i<T;i++){
			String line = reader.readLine();
			String[] splits = line.split(" ");
			int N = Integer.parseInt(splits[0]);
			int S = Integer.parseInt(splits[1]);
			int p = Integer.parseInt(splits[2]);
			
			int not_sp  = 3*p - 2;
			int sp_up   = 3*p - 3;
			int sp_down = 3*p - 4;
			int result  = 0;
			
 			for(int j = 3;j<splits.length;j++){
				int num = Integer.parseInt(splits[j]);
				if(num >= not_sp){
					result ++;
				}
				else if(num >= sp_down&&num<=sp_up&&num>=p){
					if(S>0){
						result ++;
						S--;
					}		
				}
 			}
 			
 			writer.write("Case #"+(i+1)+": "+result+"\n");
 			writer.flush();
		}
		
		
	}

}
