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 birgit.vera.schmidt.googlecodejam2012.qual;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;

public class B {
  public static void main(String[] args) {
    try {
      String filename = "B-large";
      BufferedReader in = new BufferedReader(new FileReader(new File(filename + ".in")));
      PrintStream out = new PrintStream(new FileOutputStream(new File(filename + ".out")));

      int t = Integer.parseInt(in.readLine());

      for (int i = 0; i < t; i++) {
        out.println("Case #" + (i+1) + ": " + calcCase(in.readLine()));
      }

    } catch (IOException e) {
      // Just crash.
      e.printStackTrace();
    }
  }

  private static int calcCase(String line) {
    String[] parts = line.split(" ");
    int n = Integer.parseInt(parts[0]);
    int s = Integer.parseInt(parts[1]);
    int p = Integer.parseInt(parts[2]);
    int[] g = new int[n];
    for (int i = 0; i < n; i++) {
      g[i] = Integer.parseInt(parts[i+3]);
    }

    int ok = 0;
    int okWithSurprising = 0;
    int notOk = 0;

    int limitOkWithoutSurprising = 3*p-2;
    int limitOkWithSurprising = Math.max(3*p-4, 2);

    for (int score : g) {
      if (score >= limitOkWithoutSurprising) {
        ok++;
      } else if (score >= limitOkWithSurprising) {
        okWithSurprising++;
      } else {
        notOk++;
      }
    }

    return ok + Math.min(okWithSurprising, s);
  }
}
