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.util.*;

public class Dance
{
    public static void main(String args[])
    {
        Scanner input = new Scanner(System.in);
        int numCase;
        numCase = input.nextInt();
        for(int n=0; n<numCase; n++)
        {
            int numGoog, surprising, min, maxAboveMin;
            maxAboveMin = 0;

            numGoog = input.nextInt();
            surprising = input.nextInt();
            min = input.nextInt();

            int[] scores = new int[numGoog];
            int[] bestIfS = new int[numGoog];
            int[] bestIfNS = new int[numGoog];
            for(int i=0; i<numGoog; i++)
            {
                scores[i] = input.nextInt();
                if(scores[i]>0)
                {
                    bestIfS[i] = (int)((double)scores[i]/3+1.5);
                    bestIfNS[i] = (int)((double)scores[i]/3+0.7); // Rounding
                } else {
                    bestIfS[i] = 0;
                    bestIfNS[i] = 0;
                }

                /*
                 *System.out.printf("S:%d !:%d N:%d\n",scores[i]
                 *                                     bestIfS[i],
                 *                                     bestIfNS[i]);
                 */
            }

            for(int i=0; i<numGoog; i++)
            {
                if(bestIfNS[i]>=min) { maxAboveMin++; }
                else if (surprising>0 && bestIfS[i]>=min)
                {
                    maxAboveMin++;
                    surprising--;
                }
            }

            System.out.printf("Case #%d: %d\n",n+1,maxAboveMin);

        }
    }
}
