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;

class DWtG {
    public static BufferedReader br = null;
    public static int numCases;
    public static int numDancers;
    public static int numSurprises;
    public static int p; // p is given by the problem as the "best score"
    public static String[] input;

    public static void main(String[] args) {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));

            numCases = Integer.parseInt(br.readLine().trim());

            for(int i = 0; i < numCases; i++) {
                input = br.readLine().split(" ");
                numDancers = Integer.parseInt(input[0]);
                numSurprises = Integer.parseInt(input[1]);
                p = Integer.parseInt(input[2]);
                int maxDancers = 0;

                for(int j = 3; j < input.length; j++) {
                    if(maxReg(Integer.parseInt(input[j])) >= p)
                        maxDancers++;
                    else if(numSurprises > 0 && maxSpecial(Integer.parseInt(input[j])) >= p) {
                        maxDancers++;
                        numSurprises--;
                    }
                }
                System.out.println("Case #" + (i+1) + ": " + maxDancers);
            }
        }
        catch(Exception e) {
            e.getMessage();
            e.printStackTrace();
        }
    }

    public static int maxReg(int n) {
        if(n == 0)
            return 0;
        else if(n == 1)
            return 1;
        else if(n == 2)
            return 1;
        else if(n % 3 == 0)
            return (n / 3);
        else if(n % 3 == 1)
            return (n / 3) + 1;
        else if(n % 3 == 2)
            return (n / 3) + 1;
        return -1;
    }

    public static int maxSpecial(int n) {
        if(n == 0)
            return 0;
        else if(n == 1)
            return 1;
        else if(n == 2)
            return 2;
        else if(n % 3 == 0)
            return (n / 3) + 1;
        else if(n % 3 == 1)
            return (n / 3) + 1;
        else if(n % 3 == 2)
            return (n / 3) + 2;
        return -1;
    }
}
