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.*;
import java.util.*;
import java.lang.Math.*;

public class DancingWithTheGooglers {

	public static void main(String[] args) throws IOException{
		Scanner in = new Scanner(new File("DancingWithTheGooglers.in"));
	    PrintWriter p = new PrintWriter("DancingWithTheGooglers.out");
	    int t = Integer.parseInt(in.nextLine());
	    int n;
	    int s;
	    int h;
	    int q;
	    int [] d = new int[100]; 
	    for(int c = 1; c < t+1; c++){
	    	q = 0;
	    	n = Integer.parseInt(in.next());
	    	s = Integer.parseInt(in.next());
	    	h = Integer.parseInt(in.next())-1;
	    	for (int i = 0; i < n; i++){
	    		d[i] = Integer.parseInt(in.next());
	    		if(d[i] > 3*h){
	    			q++;
	    		}else if((d[i]==3*h||d[i]==3*h-1)&&s > 0&& h!= 0){
	    			q++;
	    			s--;
	    		}
	    	}
	    	p.println("Case #"+c+": "+q);
	    	if(c!=t)in.nextLine();
	    }
	    in.close();
	    p.close();
	}

}