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 dancers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;

public class DancerEvaluation {

    private final int numberOfGooglers;
    private int surpriseCount;
    private final int bestScore;
    private final int[] lstOfPoints;

    public DancerEvaluation(int numberOfGooglers, int surpriseCount, int bestScore, int[] lstOfPoints) {
	this.numberOfGooglers = numberOfGooglers;
	this.surpriseCount = surpriseCount;
	this.bestScore = bestScore;
	this.lstOfPoints = lstOfPoints;

    }

    public int solve() {
	int countOfTotalDancers = 0;
	for (int i = 0; i < lstOfPoints.length; i++) {
	    int avg_point = lstOfPoints[i]/3;
	    int x = avg_point;
	    int y = avg_point;
	    int z = avg_point;

	    int leftOver = lstOfPoints[i] % 3;

	    switch (leftOver) {
	    case 0:
		if(avg_point + 1 == bestScore && surpriseCount > 0 && avg_point > 0){
		    z = z + 1;
		    x = x - 1;
		    surpriseCount--;
		}

   		break;
	    case 1:
		z = z + 1;
		break;
	    case 2:
		 if(surpriseCount > 0 && (z + 2) <= 10 && (z + 2) == bestScore){
		    z = z + 2;
		    surpriseCount--;
		}else {
		    z = z+1;
		    y = y+1;
		}
		break;
	    }

	    if(Math.max(Math.max(x, y), z) >= bestScore){
		countOfTotalDancers++;
	    }

	}

	return countOfTotalDancers;
    }

    public static void main(String[] args) throws Exception{
	BufferedReader reader = new BufferedReader(new FileReader(new File("C:\\Users\\maheshsa\\Desktop\\input.txt")));
	int numOfTestCases = Integer.parseInt(reader.readLine());
	FileWriter fw = new FileWriter(new File("C:\\Users\\maheshsa\\Desktop\\output.txt"));
	for (int i = 1; i <= numOfTestCases; i++) {
	    String[] inputAsString = reader.readLine().split(" ");
	    int[] input = new int[inputAsString.length];
	    for (int j = 0; j < inputAsString.length; j++) {
		input[j] = Integer.parseInt(inputAsString[j]);
	    }
	    int numberOfDancers = input[0];
	    int surpriseCount = input[1];
	    int bestScore = input[2];
	    int[] scores = Arrays.copyOfRange(input, 3, input.length);
	    fw.append("Case #" + i + ": " + new DancerEvaluation(numberOfDancers, surpriseCount, bestScore, scores).solve() + "\n");
	}

	fw.flush();

	reader.close();
	fw.close();

    }

}
