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.*;
import java.io.*;
class Dancing{
  public static void main(String args[])
  {     
    File file = new File("B-small-attempt0.in");
    try{
      FileWriter fstream = new FileWriter("result.txt");
      BufferedWriter out = new BufferedWriter(fstream);
      Scanner sc = new Scanner(file);
      int tcs = sc.nextInt(); //test cases
  
      for(int tc = 1; tc <=tcs; tc++)
      {
        int words = sc.nextInt();
        int surprising = sc.nextInt();
        int p = sc.nextInt();
        int converted = 0;
        int normal = p + (p-1) + (p - 1);
        int snormal = normal - 2;
        while(words-- > 0)
        {
          int candidate = sc.nextInt();
          if(candidate < p) continue;
          if(candidate >= normal)
          {
            converted += 1;
          }
          else if(surprising > 0 && candidate >= snormal)
          {
            surprising--;
            converted++;
          }
        }
        out.write("Case #" + tc + ": "+converted+"\r\n");
      }
      out.close();
    } catch (Exception e) {e.printStackTrace();}
  }
}