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

// library In.java at http://introcs.cs.princeton.edu/stdlib/stdlib.jar

public class PB {
    public static void main (String[] args) {
        int t, n, s, p;
        
        int num, mod, quot;
        int maybe;
        int counter;
        int max;
        
        In in = new In("input.txt");
        t = Integer.parseInt(in.readLine());
        
        int i = 1;
        // get input
        while (in.hasNextLine()) {
            maybe = 0;
            counter = 0;
            n = in.readInt();
            s = in.readInt();
            p = in.readInt();
            
            for (int j = 0; j < n; j++) {
                num = in.readInt();
                quot = num / 3;
                mod = num % 3;

                if (mod == 1) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 2 <= num) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 0){ 
                    if (quot >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 3 <= num && num != 0) {
                        maybe++;
                        continue;
                    }
                }
                if (mod == 2) {
                    if (quot + 1 >= p) {
                        counter++;
                        continue;
                    }
                    if (3 * p - 4 <= num) {
                        maybe++;
                        continue;
                    }
                }
            }
            max = Math.min(s, maybe);
            
            System.out.print("Case #" + i + ": " + (max + counter) + "\n");
            i++;
        }
    }
}
