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 tr0llhoehle.cakemix.googleCodejam;

import tr0llhoehle.cakemix.utility.googleCodeJam.Solver;

public class DWGSolver implements Solver<DWGProblem> {

	@Override
	public String solve(DWGProblem p) {
		int numberOfBestResult = 0;
		int surprising = 0;

		/*
		 * for (int sum : p.getDancerSums()) { int[] triplet = new int[3];
		 * boolean done = false; int remainder = sum % 3;
		 * 
		 * for (int i : triplet) { i = sum / 3;
		 * 
		 * if (remainder > 0) { i++; remainder--; } // not-surprising triplets
		 * generated.
		 * 
		 * if (i >= p.getBorder()) { numberOfBestResult++; done = true; break; }
		 * }
		 * 
		 * if (!done && sum > 1 && surprising < p.getNumberOfSuprisingTriplets()
		 * && triplet[0] + 1 >= p.getBorder()) { numberOfBestResult++;
		 * surprising++;
		 * 
		 * } }
		 */

		for (int sum : p.getDancerSums()) {
			int avg = sum / 3;
			int remainder = sum % 3;

			if (sum == 0) {
				if (p.getBorder() <= 0) {
					numberOfBestResult++;
				}
			} else if (sum == 1) {
				if (p.getBorder() <= 1) {
					numberOfBestResult++;
				}
			} else { // sum >= 2
				switch (remainder) {
				case 0:
					if (avg >= p.getBorder()) {
						numberOfBestResult++;
					} else if (surprising < p.getNumberOfSuprisingTriplets()
							&& avg + 1 >= p.getBorder()) {
						numberOfBestResult++;
						surprising++;
					}
					break;
				case 1:
					if (avg + 1 >= p.getBorder()) {
						numberOfBestResult++;
					}
					break;
				case 2:
					if (avg + 1 >= p.getBorder()) {
						numberOfBestResult++;
					} else if (surprising < p.getNumberOfSuprisingTriplets()
							&& avg + 2 >= p.getBorder()) {
						numberOfBestResult++;
						surprising++;
					}
					break;
				}
			}
		}

		return numberOfBestResult + "";
	}
}
