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.*;

public class B {

  public static void main(String[] args) {
    new B();
  }
  
  public B() {
    Scanner scan = new Scanner(System.in);
    int NCASES = scan.nextInt();
    for (int ZZ = 1; ZZ <= NCASES; ZZ++) {
      System.out.print("Case #"+ZZ+": ");
      int N = scan.nextInt();
      int S = scan.nextInt();
      int p = scan.nextInt();
      int count = 0;
      for (int i = 0; i < N; i++) {
        int t = scan.nextInt();
        if (t < p) continue;
        if (t > (p-1)*3) {
          count++;
        } else if (t >= p*3-4 && S > 0) {
          count++;
          S--;
        }
      }
      System.out.println(count);
    }
  }
  
}
