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.Scanner;
import java.io.*;

public class Google3 {
  public static void main(String[] args) throws IOException {
    Scanner kb = new Scanner(new File("c:/input.in"));
//    Scanner kb = new Scanner(System.in);
    int numCase = kb.nextInt();
    for (int i = 0; i < numCase; i++) {
      int numGoogler = kb.nextInt();
      int numSurprising = kb.nextInt();
      int p = kb.nextInt();
      int minSurprising = (p * 3) - 4;
      int minOrdinary = (p * 3) - 2;
      if (p == 0 || p == 1) {
        minSurprising = p;
        minOrdinary = p;
      }
      int count = 0;
      int countSurprising = 0;
      for (int j = 0; j < numGoogler; j++) {
        int point = kb.nextInt();
        if (point < minSurprising);
        else if (point >= minOrdinary) {
          count++;
        }
        else if (point >= minSurprising && point <= minOrdinary && countSurprising < numSurprising) {
          count++;
          countSurprising++;
        }
      }
      System.out.println("Case #" + (i + 1) + ": " + count);
    }
  }
}

