import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.FileInputStream;
import java.util.Arrays;
import java.util.Scanner;


public class B {

  public static int gao(int s, int p , int[] ss) {
    int p1 = p + Math.max(0,p-1) * 2;
    int p2 = p + Math.max(0,p-2) * 2;
    
    Arrays.sort(ss);
    int ret = 0;
    for (int i = ss.length - 1; i >=0; --i) {
      int n = ss[i];
      if (n >= p1) {
        ret ++;
      } else  if (n >= p2 && s > 0) {
        ret ++;
        s--;
      }
    }
    
    
    return ret;
    
  
  }
  
  public static void main(String[] args) throws Exception {
    
    
    //InputStream in = System.in;
    InputStream in = new FileInputStream("c:\\B-small-attempt0.in");
    
    Scanner scanner = new Scanner(in);
    //BufferedReader r = new BufferedReader(new InputStreamReader(in));
    /*
    for (;;) {
      String l = r.readLine();
      if (l == null) {
        break;
      }
    }
    */
    
    int n;
    n = scanner.nextInt();
    for (int i = 1; i <= n; ++i) {
      int m = scanner.nextInt();
      int s = scanner.nextInt();
      int p = scanner.nextInt();
      int[] ss = new int[m];
      for (int j = 0; j < m; ++j) {
        ss[j] = scanner.nextInt();
      }
      System.out.println("Case #" + i + ": " + gao(s, p, ss));
    }
    
    
    
  }

}
