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

package dance;

import java.util.Scanner;

public class Dance {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int t = scanner.nextInt();//the number of test cases
        int[] y = new int[t];

        for (int i = 0; i < t; i++) {
            int n, s, p;
            y[i] = 0;
            n = scanner.nextInt();//the number of Googlers
            int[] tp = new int[n];//the total points of the Googlers.
            s = scanner.nextInt();//the number of surprising triplets of scores
            p = scanner.nextInt();// a best result of at least p
            for (int j = 0; j < n; j++) {
                tp[j] = scanner.nextInt();
                if (((tp[j] + 2) / 3) >= p) {
                    y[i]++;
                } else if (((tp[j] + 4) / 3) >= p & s > 0&tp[j]>=2) {
                    y[i]++;
                    s--;
                }
            }

        }
        for (int i = 0; i < t; i++) {
            System.out.println("Case #"+(i+1)+": "+y[i]);
        }

    }
}
