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();
  }


}

package codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

/*
 import lib.tuple.Pair;
 import lib.tuple.Tuple;
 import lib.util.StringUtil;
 */

public class CodeJam2012RQB {

  static final String fileIn = "/Users/jhorwitz/Documents/workspace/test/src/codejam/data/RQ-B-in.txt"; //"data/in.txt";
  static final String fileOut = "/Users/jhorwitz/Documents/workspace/test/src/codejam/data/RQ-B-out.txt"; //"data/out.txt";

  public static void main(String[] args) throws Exception {
    BufferedReader r = new BufferedReader(new FileReader(fileIn));
    BufferedWriter w = new BufferedWriter(new FileWriter(fileOut));
    String line = r.readLine();
    int T = Integer.parseInt(line);
    for (int caseNum = 1; caseNum <= T; caseNum++) {
      line = r.readLine();
      String str = "Case #" + caseNum + ": " + solve(line);
      w.write(str + "\n");
      System.out.println(str);
    }
    w.close();
    r.close();
  }

  private static int solve(String line) {
    String[] inputLineAsAnArray = line.split(" ");
    int N = Integer.parseInt(inputLineAsAnArray[0]);
    int S = Integer.parseInt(inputLineAsAnArray[1]);
    int p = Integer.parseInt(inputLineAsAnArray[2]);
    int[] t = new int[N];
    int numGooglersWithMaxScoreGreaterThanP = 0;

    for (int i=0; i<N; ++i) { // fill t array--separate for loop from below solely for debug purposes
      t[i] = Integer.parseInt(inputLineAsAnArray[3+i]);
    }

    for (int iGoogler=0; iGoogler<N; ++iGoogler) {
      int tBy3 = t[iGoogler]/3;
      switch(t[iGoogler] % 3) {
        case 0:
          if(tBy3 >= p && 0<=tBy3 && tBy3<=10) { // no need for a surprising triplet for this Googler to get p or more
            ++numGooglersWithMaxScoreGreaterThanP;
          } else if(tBy3+1 == p && 0<=tBy3-1 && tBy3+1<=10) {  // a surprising triplet is needed for this Googler to get a p or more -- "use" one if there's one left
            if(S>0) {
              ++numGooglersWithMaxScoreGreaterThanP;
              --S;
            }
          }
          // if neither of those cases, then not valid triplet (surprising or otherwise) could give this Googler a p or more
          break;
        case 1:
          if(tBy3 + 1 >= p && 0<=tBy3 && tBy3+1<=10) { // no need for a surprising triplet for this Googler to get p or more
            ++numGooglersWithMaxScoreGreaterThanP;
          } // for this case (1 mod 3), a surprising triplet will have the same max as a non-surprising one
          // so otherwise, then not valid triplet (surprising or otherwise) could give this Googler a p or more
          break;
        case 2:
          if(tBy3 + 1 >= p && 0<=tBy3 && tBy3+1<=10) { // no need for a surprising triplet for this Googler to get p or more
            ++numGooglersWithMaxScoreGreaterThanP;
          } else if(tBy3 + 2 == p && 0<=tBy3 && tBy3+2<=10) {  // a surprising triplet is needed for this Googler to get a p or more -- "use" one if there's one left
            if(S>0) {
              ++numGooglersWithMaxScoreGreaterThanP;
              --S;
            }
          }
          // if neither of those cases, then not valid triplet (surprising or otherwise) could give this Googler a p or more
          break;
        // default left out since there better only be the three listed cases!
      }
    }

    return numGooglersWithMaxScoreGreaterThanP;
  }
}