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.util.Scanner;

public class B2 {

  /**
   * @param args
   */
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int nbrCases = sc.nextInt();
    for (int i = 1; i <= nbrCases; ++i) {
      sc.nextLine();
      System.out.print("Case #" + i + ": ");

      int nbrGooglers = sc.nextInt();
      int nbrSurprising = sc.nextInt();
      int atLeast = sc.nextInt();

      // The lowest value of a triplet which isn't surprising with
      // at least N is a triplet with the values N, N-1 and N-1
      int lowestNonSurprisingSum = 3 * atLeast - 2;
      // The lowest value of a triplet which is surprising with
      // at least N is a triplet with the values N, N-2 and N-2
      int lowestSurprisingSum = 3 * atLeast - 4;
      // Base cases
      if (atLeast == 0) {
        lowestNonSurprisingSum = 0;
        lowestSurprisingSum = 0;
      } else if (atLeast == 1) {
        lowestNonSurprisingSum = 1;
        lowestSurprisingSum = 1;
      }

      int nbrNonSurprisingFound = 0;
      int nbrSurprisingFound = 0;
      for (int j = 0; j < nbrGooglers; ++j) {
        int score = sc.nextInt();
        if (score >= lowestNonSurprisingSum) {
          ++nbrNonSurprisingFound;
        } else if (score >= lowestSurprisingSum) {
          ++nbrSurprisingFound;
        }
      }

      int max = nbrNonSurprisingFound + Math.min(nbrSurprisingFound, nbrSurprising);
      System.out.println(max);
    }
  }
}
