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;
    }
}





public class DancingWithTheGooglers extends ProgrammingProblem
{

  static int min[] = { 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10 };
  static int max[] = { 0, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10 };

  int N, S, p, t[];

  @Override
  protected void print()
  {

  }

  @Override
  protected void readInput()
  {
    N = sc.nextInt();
    S = sc.nextInt();
    p = sc.nextInt();
    t = new int[N];
    for (int i = 0; i < N; i++)
    {
      t[i] = sc.nextInt();
    }
  }

  @Override
  protected String execute()
  {
    int c = 0;
    for (int i = 0; i < N; i++)
    {
      if (min[t[i]] >= p || (max[t[i]] >=p && S-- > 0 ))
      {
        c++;
      }
    }

    return c + "";
  }

  public static void main(String[] args) throws Exception
  {
    DEBUG = false;
    main(DancingWithTheGooglers.class);
  }
}
