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 com.googlerese.file;

public class GooglersBean {

    private int numGooglers;

    private int surprising;

    private int result;

    private int[] scores = new int[100];

    public int getNumGooglers() {
        return numGooglers;
    }

    public int getSurprising() {
        return surprising;
    }

    public int getResult() {
        return result;
    }

    public int[] getScores() {
        return scores;
    }

    public void setNumGooglers( int numGooglers ) {
        this.numGooglers = numGooglers;
    }

    public void setSurprising( int surprising ) {
        this.surprising = surprising;
    }

    public void setResult( int result ) {
        this.result = result;
    }

    public void setScores( int[] scores ) {
        this.scores = scores;
    }

    public void addScore( int index, int score ) {
        scores[index] = score;
    }

}
