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.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
import java.io.FileWriter;

public class DancingWithTheGooglers {
  public static void main(String... args) {

    try {
      File f = new File("B-large.in");
      File outFile = new File("output.txt");
      FileWriter w = new FileWriter(outFile);
      Scanner s = new Scanner(f);
      int T = s.nextInt();
      s.nextLine();
      for(int i = 1; i<= T; i++) {
        int N = s.nextInt();
        int S = s.nextInt();
        int p = s.nextInt();
        int[] t = new int[N];
        for(int j = 0; j < N; j++) {
          t[j] = s.nextInt();
        }
        int max = findMax(N,S,p,t);
        String line = "Case #" + i +": " + max + '\n';
        System.out.print(line);
        w.write(line);
        if(s.hasNextLine()) s.nextLine();
      }
      w.close();
    }
    catch(Exception e) { }
  }
  private static int findMax(int N, int S, int p, int[] t) {
    int possible = 0;
    int surprising = 0;
    for(int i = 0; i < t.length; i++) {
      if(p == 1) {
        if(t[i] >= 1) {
          possible++;
        }
      }
      else if(t[i] >= (3*p - 2)){
        possible++;
      }
      else if(t[i] >= (3*p - 4)) {
        surprising++;
      }
    }
    return possible + Math.min(surprising, S);
  }
}