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

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class B {

    public static void main(String[] args) throws Throwable {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        int numCases = Integer.parseInt(reader.readLine());

        for (int c = 1; c <= numCases; c++) {
            System.out.println("Case #" + c + ": " + solveCase(reader.readLine()));
        }
    }

    private static int solveCase(String line) {
        String[] tokens = line.split(" ");
        int numGooglers = Integer.parseInt(tokens[0]);
        int surprisingTriplets = Integer.parseInt(tokens[1]);
        int p = Integer.parseInt(tokens[2]);
        int[] results = new int[numGooglers];
        for (int i = 0; i < numGooglers; i++) {
            results[i] = Integer.parseInt(tokens[i + 3]);
        }

        int num = 0;

        for (int i = 0; i < numGooglers; i++) {
            int res = results[i];
            int lowestScore = res / 3;
            int highestScore = lowestScore;
            int remainder = res - lowestScore * 3;
            if (remainder > 0) {
                highestScore++;
            }
            if (highestScore >= p) {
                num++;
            } else if (surprisingTriplets > 0) {
                switch (remainder) {
                case 0: // 222 -> 123
                    if (lowestScore > 0 && highestScore + 1 >= p) {
                        num++;
                        surprisingTriplets--;
                    }
                    break;
                case 1: // 223 -> 133
                    if (lowestScore > 0 && highestScore >= p) {
                        num++;
                        surprisingTriplets--;
                    }
                    break;
                case 2: // 233 -> 224
                    if (highestScore + 1 >= p) {
                        num++;
                        surprisingTriplets--;
                    }
                    break;
                }
            }
        }
        return num;
    }
}
