import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


import java.util.Scanner;


public class C {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int no = sc.nextInt();

    for (int s = 1; s <= no; s++) {
      int players = sc.nextInt();
      int stars = sc.nextInt();
      int best = sc.nextInt();

      int count = 0;

      int k;
      for (int i = 0; i < players; i++) {
        int j = sc.nextInt();
        k = (int) Math.floor(j / 3);
        if (k >= best) {
          count++;
        } else if (k < best) {
          int diff = j - (k * 3);
          if (diff == 1 && (diff + k) == best) {
            count++;
            continue;
          } else if (diff == 2) {
            if ((k + 1) == best) {
              count++;
              continue;
            } else if (stars > 0 && (k + diff) == best) {
              count++;
              stars--;
              continue;
            }
          } else if (diff == 0) {
            int first = k - 1;
            int second = k;
            int third = k + 1;
            if ((stars > 0) && (third == best) && first >= 0) {
              stars--;
              count++;
              continue;
            }
          }
        }


      }
      System.out.println("Case #" + s + ": " + count);

    }
  }
}
