import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancingwiththegooglers;

import java.io.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 *
 * @author ÐÐ¸ÑÐ¸Ð»Ð» Ð¸ ÐÐ°Ð¿Ð°
 */
public class DancingWithTheGooglers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("input.in")));
            BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output.txt")));
            int numOfTestCases = Integer.parseInt(br.readLine());
            for (int testCaseI = 0; testCaseI < numOfTestCases; testCaseI++) {
                StringTokenizer st = new StringTokenizer(br.readLine());
                int n = Integer.parseInt(st.nextToken());
                int s = Integer.parseInt(st.nextToken());
                int p = Integer.parseInt(st.nextToken());
                int[] t = new int[n];
                for (int i = 0; i < n; i++) {
                    t[i] = Integer.parseInt(st.nextToken());
                }
                int res = 0;
                int availableSurp = s;
                for (int i = 0; i < t.length; i++) {
                    int bestRes = (t[i] + 2) / 3;
                    if ((bestRes < p) && (availableSurp > 0) && (t[i] >= 2)) {
                        int r = (t[i] + 4) / 3;
                        if (r >= p) {
                            bestRes = r;
                            availableSurp--;
                        }
                    }
                    res += ((bestRes >= p) ? 1 : 0);
                }
                bw.write("Case #" + (testCaseI + 1) + ": " + res);
                bw.newLine();
            }
            br.close();
            bw.close();
        } catch (Exception ex) {
            ex.printStackTrace();
        }
    }
}
