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

/**
 *
 * @author ffreakk
 */

import java.util.Scanner;
import java.lang.Math;
public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        for (int t=1; t<=T; t++){
            int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int nSurprises = 0;
            int result = 0;
            int surpriseScore = 3*p - 4;
            int okScore = 3*p - 2;

            int scoreArray[] = new int[N];
            for (int n=0; n<N; n++) {
                scoreArray[n] = in.nextInt();
            }

            for (int i=0; i<N; i++) {
                if (scoreArray[i] >= okScore)
                    result++;
                else if (scoreArray[i] >= surpriseScore && scoreArray[i]>0)
                    nSurprises++;
            }

            result += Math.min(nSurprises, S);
            System.out.println("Case #" +t+ ": " + result);
        }
    }

}
