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.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Dance {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int n = Integer.parseInt(str[0]);
                int s = Integer.parseInt(str[1]);
                int p = Integer.parseInt(str[2]);
                int[] tis = new int[n];
                for (int j = 0; j < tis.length; j++) {
                    tis[j] = Integer.parseInt(str[3+j]);
                }

                System.out.println("Case #" + (i + 1) + ": " + find(n,s,p,tis));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int n, int s, int p, int[] tis) {
        Arrays.sort(tis);
        int normalScore = Math.max(3*p-2, 0);
        int surpriseScore = 3*p-4;
        if (surpriseScore < 0) surpriseScore = normalScore;
        int ind = tis.length-1;
        for (; ind >= 0 && tis[ind] >= normalScore; ind--);
        for (int i=0; ind >= 0 && i < s && tis[ind] >= surpriseScore; ind--, i++);
        return n-ind-1;
    }
}
