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 codejam2012.qr.dancing;

import java.util.concurrent.atomic.AtomicInteger;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author fedez
 */
public class DancerSolver
{

    private static Logger logger = Logger.getLogger(DancerSolver.class.getName());

    public static int solve(int googlers, int[] scores, int suprises, int scoreTopass)
    {
        AtomicInteger surprisesLeft;
        int numberOfPasses = 0;
        int score, i, possible;

        surprisesLeft = new AtomicInteger(suprises);
        for (i = 0; i < googlers; i++)
        {
            score = scores[i];
            possible = isItPossible(score, surprisesLeft, scoreTopass);
            logger.log(Level.INFO, "Score:{0}, surprisesLeft:{1}, scoreTopass:{2}, result:{3}", new Object[]
                    {
                        score, surprisesLeft, scoreTopass, possible
                    });

            numberOfPasses += possible;
        }

        return numberOfPasses;
    }

    private static int isItPossible(double score, AtomicInteger surprisesLeft, int scoreTopass)
    {
        double remainder, leftValues, lowestValue;

        if (scoreTopass == 0)
        {
            return 1;
        }

        remainder = score - scoreTopass;
        if (remainder < 0)
        {
            return 0;
        }
        
        leftValues = remainder / 2d;
        if (remainder % 2 == 0)
        {
            lowestValue = leftValues;
        }
        else
        {
            lowestValue = Math.floor(leftValues);
        }
        if (scoreTopass - lowestValue <= 1)
        {
            return 1;
        }
        else if (scoreTopass - lowestValue <= 2 && surprisesLeft.get() > 0)
        {
            surprisesLeft.decrementAndGet();
            return 1;
        }
        else
        {
            return 0;
        }
    }
}
