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

package codejam.qual_2012;

import java.io.File;
import java.io.PrintStream;
import java.util.Scanner;

public class MainB {

    public static void main(String[] args) throws Exception {

        String f = "/home/floris/dev/java/Test/src/codejam/qual_2012/B-large.in";
        Scanner sc = new Scanner(new File(f));
        System.setOut(new PrintStream(new File(f+".out")));
        int T = sc.nextInt();
        for (int i=1; T-- > 0; i++) {
            int numberOfGooglers = sc.nextInt();
            int numberOfSurprises = sc.nextInt();
            int p = sc.nextInt();
            int[] values = new int[numberOfGooglers];
            for (int j = 0; j < numberOfGooglers; j++) {
                values[j] = sc.nextInt();
            }
            
            System.out.printf("Case #%d: %d%n", i, solve(numberOfGooglers, numberOfSurprises, p, values));
        }
    }

    private static int solve(int numberOfGooglers, int numberOfSurprises, int p, int[] values) {
        int result = 0;
        for (int v : values) {
            int d = v % 3;
            if (v == 0) {
                if (p==0) result++;
            } else if (v == 1) {
                if (p<=1) result++;
            } else if (d == 0) {
                if (v/3 >= p) result++;
                else if (numberOfSurprises>0 && (v/3+1)>=p) {result++; numberOfSurprises--;}
            } else if (d==1) {
                if (v/3+1 >= p) result++;
            } else if (d==2) {
                if (v/3+1 >= p) result++;
                else if (numberOfSurprises>0 && (v/3+2)>=p) {result++; numberOfSurprises--;}
            }
        }
        return result;
    }
}
