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 qualification.b;

import java.util.Scanner;

public class DancingWith {

	/**
	 * OK, I think the algorithm is this:
	 * for each googler's score:
	 * -could this have a highest value > N when it's unsurprising? If so, count it.
	 * If not,
	 * 	-- do we have a surprising score left?
	 * 	--can we get above N by making it surprising?
	 * 		If so, use up a 'surprising' point and make it so.
	 * 	you don't have to backtrack. there are at most 100 googlers
	 * 	so performance should be easy?
	 */

	public static void main(final String[] args) {
		new DancingWith().start();
	}

	private void start() {
		final Scanner s = new Scanner(System.in);
		final int numTests = s.nextInt();
		for (int i = 0; i < numTests; i++) {
			//			deb("Case " + (i + 1) + "---------");
			final int numGooglers = s.nextInt(); //<= 100
			final int numSurprises = s.nextInt();
			final int scoreRequired = s.nextInt();

			//output and calculation variables
			int surprisesLeft = numSurprises;
			int matchesFound = 0;
			for (int g = 0; g < numGooglers; g++) { //for each googler
				final int score = s.nextInt();
				if (highEnough(score, scoreRequired, false)) {
					matchesFound++;
				} else if (surprisesLeft > 0 && highEnough(score, scoreRequired, true)) {
					surprisesLeft--;
					matchesFound++;
				}
			}
			System.out.println("Case #" + (i+1) + ": " + matchesFound);
		}
	}

	//we have the sum of three scores, at most 1 apart.
	//[todo] There are only 30 possible scores so we could precalc or cache these.
	//this code keeps the value of the middle score as low as possible.
	private boolean highEnough(final int score, final int scoreRequired, final boolean surprising) {
		final int range = surprising ? 2 : 1;
		int one = score; //only decreases
		int two = 0; //only increases
		int three = 0; //only increases
		while (one - three > range) {
			//three can't increase above two - keep the order.
			if (three < two) {
				one--;
				three++;
			} else {
				one--;
				two++;
			}
		}
		//		deb(three + " " + two + " " + one + (one >= scoreRequired ? "*" : "") + (surprising ? " S" : ""));
		return (one >= scoreRequired);
	}

	//	private void deb(final String value) {
	//		System.out.println(value.toString());
	//	}

}
