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.*;
import java.io.*;
class Dancing{
  public static void main(String args[])
  {     
    File file = new File("B-large.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();}
  }
}