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;
    }
}


/**
 * Copyright Carma Systems, Inc. All rights reserved.
 */
package com.jessehutton.codejam.qualification2012;

import com.jessehutton.codejam.util.IOHandler;

import java.io.IOException;

/**
 *
 * @author Jesse Hutton <jesse.hutton@carmasys.com>
 */
public class DancingWithGooglers {

  public static void main(String[] args) throws NumberFormatException, IOException {
    String inFile = "/home/jesse/Downloads/B-large.in";
    String outFile = "/home/jesse/Desktop/Dancing-googlers-large.out";

    IOHandler io = new IOHandler(new String[] {inFile, outFile}) {
      @Override
      public String formatCase(int caseNum, Object result) {
        return String.format("Case #%d: %s", caseNum, result);
      }
    };

    int T = Integer.parseInt(io.line().trim());
    for (int c = 1; c <= T; c++) {
      String[] tokens = io.line().split(" ");
      int nGoo = Integer.parseInt(tokens[0]);
      int sups = Integer.parseInt(tokens[1]);
      int p = Integer.parseInt(tokens[2]);
      int results = 0;

      for (int t = 3; t < 3 + nGoo; t++) {
        int tot = Integer.parseInt(tokens[t]);
        int fact = tot / 3;
        int rem = tot % 3;

        if (tot == 0) {
          if (p == 0) {
            results++;
          }
          continue;
        }

        if (fact >= p) {
          results++;
          continue;
        }

        int diff = p - fact;
        if (diff > 2) {
          continue;
        }

        // can arrange without using a sup
        //
        if (diff == 1 && rem >= 1) {
          results++;
          continue;
        }

        // can arrange with using a sup
        //
        if (diff == 1 && rem == 0 && sups > 0) {
          results++;
          sups--;
          continue;
        }

        // diff == 2
        //
        if (sups > 0 && rem == 2) {
          sups--;
          results++;
        }
      }
      io.recordCase(c, results);
    }
    io.finish();
  }

}
