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

public class B {
  public static void main(String[] args) throws IOException {
    Scanner in = new Scanner(new File("./src/B-small-attempt2.in"));
    BufferedWriter out = new BufferedWriter(new FileWriter("./src/output.out"));

    int T = in.nextInt();
    int s, p, n, v, a;
    int[] t;

    for (int zz = 0; zz < T; ++zz) {
      n = in.nextInt();
      s = in.nextInt();
      p = in.nextInt();
      t = new int[n];
      a = 0;
      v = (p - 2 < 0 ? 0 : p - 2);
      v *= 2;
      v += p;
      for (int i = 0; i < n; ++i) {
        t[i] = in.nextInt();
      }
      Arrays.sort(t);
      for (int i = 0; i < n; ++i) {
        if (p == 0) {
          ++a;
          continue;
        }
        if (p == 1 && t[i] > 0) {
          ++a;
          continue;
        }
        if (t[i] < v)
          continue;
        if ((t[i] == v || t[i] == v + 1) && s > 0) {
          --s;
          ++a;
        } else if (t[i] > v + 1)
          ++a;
      }
      out.write("Case #" + (zz + 1) + ": " + a + (zz + 1 == T ? "" : "\n"));
    }

    out.close();
    in.close();
  }
}