import java.io.*;
import java.util.*;

public class DancingWithGooglers {

  public static class Googlers {

    public int T;
    public int surp;
    public boolean surprising;
    public boolean pSurprising;
    public boolean antiSurprising;
    public boolean pAntiSurprising;

    public Googlers(int T, int surp) {
      this.T = T;
      this.surp = surp;
    }

    public void set(int a, int b, int c) {
      if (c >= 0 && (a + b + c) == T) {
        int diff = (Math.max(a, Math.max(b, c)) - Math.min(a, Math.min(b, c)));
        if (diff <= 2) {
          if (diff == 2) {
            if (a >= surp || b >= surp || c >= surp) {
              pSurprising = true;
            } else {
              surprising = true;
            }
          } else {
            if (a >= surp || b >= surp || c >= surp) {
              pAntiSurprising = true;
            } else {
              antiSurprising = true;
            }
          }
        }
      }
    }
  }

  public static void main(String... args) throws IOException {
//    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
//    PrintWriter writer = new PrintWriter(System.out);
    PrintWriter writer = new PrintWriter("B-large.out");

    int len, cases = Integer.parseInt(reader.readLine());
    List<Googlers> satisfied = new ArrayList<Googlers>();
    List<Googlers> unsatisfied = new ArrayList<Googlers>();
    String[] inputs;
    int N, S, p;
    for (int i = 1; i <= cases; i++) {
      inputs = reader.readLine().split(" ");
      p = Integer.parseInt(inputs[1]);
      S = Integer.parseInt(inputs[2]);
      satisfied.clear();
      unsatisfied.clear();
      for (int j = 3; j < inputs.length; j++) {
        int t = Integer.parseInt(inputs[j]);
        Googlers googlers = new Googlers(t, S);

        for (int k = 0; k <= 10; k++) {
          int till = k + 2 > 10 ? 10 : k + 2;
          for (int l = k; l <= till; l++) {
            googlers.set(k, l, (t - (k + l)));
          }
        }
        if (googlers.pAntiSurprising) {
          satisfied.add(googlers);
        } else {
          unsatisfied.add(googlers);
        }
      }
      int pSurprising = 0;
      if (p > 0) {
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            pSurprising++;
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            iter.remove();
            pSurprising++;
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }

      if(p > 0){
        writer.print("Case #" + i + ": 0");
      }else {
        writer.print("Case #" + i + ": " + (satisfied.size() + pSurprising));
      }
      writer.println();
    }
    writer.flush();
  }


}

import java.io.*;
import java.util.*;

public class DancingWithTheGooglers {
  
  private static final int NUM_JUDGES = 3;
  private static final int MAX_DIFF = 2;
  private static final int MIN_SCORE = 0;
  private static final int MAX_SCORE = 10;
  
  public static void main(String[] args) throws Exception {
    String fileName = args[0];
    BufferedReader reader = new BufferedReader(new FileReader(fileName + ".in"));
    PrintWriter writer = new PrintWriter(new FileWriter(fileName + ".out"));
    int cases = Integer.parseInt(reader.readLine());
    for (int i = 1; i <= cases; i++) {
      String[] data = reader.readLine().split(" ");
      int numSurprises = Integer.parseInt(data[1]);
      int minBestResult = Integer.parseInt(data[2]);
      int topGooglers = 0;
      int either = 0;
      List<Integer> doubtful = new ArrayList<Integer>();
      for (int j = 3; j < data.length; j++) {
        int totalPoints = Integer.parseInt(data[j]);
        if (totalPoints >= NUM_JUDGES * MAX_SCORE - 1) { // 29 30
          topGooglers++; // bestResult = 10, not surprise
        } else if (totalPoints <= MIN_SCORE + 1) { // 0 1
          if (totalPoints >= minBestResult) {
            topGooglers++; // bestResult = totalPoints, not surprise
          }
        } else { // we can choose between surprise or not surprise
          int bestResult = (totalPoints + (NUM_JUDGES - 1) * MAX_DIFF) / NUM_JUDGES;
          if ((totalPoints - 1) % NUM_JUDGES == 0) { // 4 7 10 13 16 19 22 25 28
            either++; // same bestResult
            if (bestResult >= minBestResult) {
              topGooglers++;
            }
          } else {
            doubtful.add(bestResult - 1); // if we choose surprise -> bestResult++
          }
        }
      }
      if (either + doubtful.size() < numSurprises) { // not enough surprises
        writer.println("Case #" + i + ": 0");
      } else {
        Collections.sort(doubtful);
        Collections.reverse(doubtful); // we want the best first
        int surprises = 0;
        for (int bestResult: doubtful) {
          if (bestResult < minBestResult && surprises < numSurprises) { // we haven't reached numSurprises yet
            surprises++; // we can afford to add one surprise
            bestResult++; // and +1 bestResult
          }
          if (bestResult >= minBestResult) {
            topGooglers++;
          }
        }
        writer.println("Case #" + i + ": " + topGooglers);
      }
    }
    reader.close();
    writer.close();
  }
  
}