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


package q2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class DancingWiththeGooglers {
   public static void main(String[] args) throws Exception {
      String input = "B-large.in";
      String output = "B-large.out";

      Scanner scan = new Scanner(new BufferedReader(new FileReader(input)));
      PrintWriter pw = new PrintWriter(new BufferedWriter(
            new FileWriter(output)));

      int T = Integer.parseInt(scan.nextLine());
      for (int t = 1; t <= T; t++) {
         String[] info = scan.nextLine().split(" ");
         int N = Integer.parseInt(info[0]);
         int S = Integer.parseInt(info[1]);
         int p = Integer.parseInt(info[2]);
         int[] score = new int[N];
         for (int i = 0; i < N; i++)
            score[i] = Integer.parseInt(info[3 + i]);
         int countp = 0;
         int counts = 0;
         int must = p + 2 * Math.max(0, p - 1);
         int might = p + 2 * Math.max(0, p - 2);
         for (int i = 0; i < N; i++)
            if (score[i] >= must)
               countp++;
            else if (score[i] >= might)
               counts++;
         int res = countp + Math.min(counts, S);
         pw.println("Case #" + t + ": " + res);
      }

      scan.close();
      pw.close();
   }

}
