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

import java.util.Scanner;

public class Main {

    static enum Mark {
        IMPOSSIBLE, SURPRISING, REGULAR;
    }

    static class Googler {
        
        private int total = 0;

        public Googler(int total)
        {
            this.total = total;
        }

        public Mark canGetMark(int mark)
        {
            if(mark > 10 || mark < 0) return Mark.IMPOSSIBLE;
            
            if(canGetMark(mark+1) == Mark.REGULAR) return Mark.REGULAR;

            if(mark + mark + mark == total) return Mark.REGULAR;
            if(mark > 0) if(mark + mark + mark - 1 == total) return Mark.REGULAR;
            if(mark > 0) if(mark + mark - 1 + mark - 1 == total) return Mark.REGULAR;
            if(mark < 10) if(mark + mark + mark + 1 == total) return Mark.REGULAR;
            if(mark < 10) if(mark + mark + 1 + mark + 1 == total) return Mark.REGULAR;

            if(canGetMark(mark+1) == Mark.SURPRISING) return Mark.SURPRISING;

            if(mark < 9) if(mark + mark + 1 + mark + 2 == total) return Mark.SURPRISING;
            if(mark < 9) if(mark + mark + 2 + mark + 2 == total) return Mark.SURPRISING;
            if(mark > 1) if(mark + mark - 1 + mark - 2 == total) return Mark.SURPRISING;
            if(mark > 1) if(mark + mark - 2 + mark - 2 == total) return Mark.SURPRISING;

            return Mark.IMPOSSIBLE;
        }

    }
   
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();

        for(int testCase = 1; testCase <= T; testCase++)
        {
            int N = sc.nextInt();
            int S = sc.nextInt();
            int p = sc.nextInt();
            int result = 0;
            for(int i = 0; i < N; i++)
            {
                Googler googler = new Googler(sc.nextInt());
                Mark mark = googler.canGetMark(p);
                if(mark == Mark.REGULAR)
                {
                    result++;
                }
                else if(mark == Mark.SURPRISING && S > 0)
                {
                    result++;
                    S--;
                }
            }
            System.out.println("Case #"+testCase+": "+result);
        }
    }

}
