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

/**
 * @author Andrey Zarubin
 */
public class Dancing {
    public static void main(String... args) throws IOException {
        String fileName = args[0];
        BufferedReader r = new BufferedReader(new FileReader(fileName));
        PrintWriter w = new PrintWriter(fileName.split("\\.")[0] + ".out.txt");
        int T = Integer.parseInt(r.readLine());
        for (int x = 0; x < T; x++) {
            Scanner sc = new Scanner(r.readLine());
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int i = 0; i < n; i++)
                t[i] = sc.nextInt();
            Arrays.sort(t);
            int y = 0;
            if (p == 0) {
                w.println("Case #" + (x + 1) + ": " + n);
                continue;
            }
            for (int i = n - 1; i >= 0; i--) {
                if (t[i] == 0)
                    break;
                if (t[i] == 1) {
                    if (p > 1)
                        break;
                    y++;
                    continue;
                }
                if ((t[i] - 1) / 3 + 1 >= p) {
                    y++;
                    continue;
                }
                if (s > 0 && (t[i] - 2) / 3 + 2 >= p) {
                    s--;
                    y++;
                    continue;
                }
                break;
            }
            w.println("Case #" + (x + 1) + ": " + y);
        }
        r.close();
        w.close();
    }
}
