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.util.*;
import java.io.*;
import static java.lang.Math.*;

public class B{
    public static void main(String[] args) throws Exception{
        new B().run();
    }

    void run() throws Exception{
        Scanner sc = new Scanner(System.in);
        //BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
        // only sc.readLine() is available
        int T = sc.nextInt();
        for(int o = 1; o <= T; o++){
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int ans = 0;
            for(; n > 0; n--){
                int t = sc.nextInt();
                if(t >= p*3){
                    ans++;
                    continue;
                }
                int d = t / 3;
                if(t%3>0)d++;
                if(d >= p){
                    ans++;
                }else if(s > 0){
                    boolean  ok = false;
                    loop:
                    for(int i = 0; i <= t; i++)
                        for(int j = i; j <= t; j++)
                            for(int k = j; k <= t; k++)
                                if(i+j+k==t){
                                    int mn = min(i, min(j, k));
                                    int mx = max(i, max(j, k));
                                    if(mx >= p && mx - mn <= 2){
                                        ok = true;
                                        break loop;
                                    }
                                }
                    if(ok){
                        ans++;
                        s--;
                    }
                }
            }
            System.out.printf("Case #%d: %d\n", o, ans);
        }
   }
}
