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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        try {
            Scanner in = new Scanner(new FileReader("in.txt"));
            PrintWriter out = new PrintWriter(new FileWriter("out.txt"), true);

            int t = in.nextInt();

            for (int i = 1; i <= t; i++) {
                int res = 0;
                int n = in.nextInt();
                int s = in.nextInt();
                int p = in.nextInt();
                int tt[] = new int[n];
                for (int j = 0; j < n; j++) {
                    tt[j] = in.nextInt();
                }
                if (p == 0) {
                    res = n;
                } else {
                    int min = 3 * p - 2;
                    for (int j = 0; j < n; j++) {
                        if (min <= tt[j]) res++;
                    }
                    int ttt[] = new int[n - res];
                    int itr = 0;
                    for (int j = 0; j < n; j++) {
                        if (min > tt[j]) ttt[itr++] = tt[j];
                    }
                    int minCrazy = 3 * p - 5;
                    int ress = 0;
                    for (int j = 0; j < itr; j++) {
                        if (minCrazy <= ttt[j] && ttt[j] != 0) ress++;
                    }
                    if (ress <= s) {
                        res += ress;
                    } else {
                        res += s;
                    }
                }

                out.println("Case #" + i + ": " + res);
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}