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 google.codejam2012.awanish;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;

public class GooglersDance {
	private static int count = 0;

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner inputScan = new Scanner(System.in);
		int noOfCases = Integer.parseInt(inputScan.nextLine());
		String cases;
		int noOfGooglers;
		int noOfSurprisingTrip;
		int topScore;
		
		for (int i = 1; i <= noOfCases; i++) {
			cases = inputScan.nextLine();
			count = 0;
			ArrayList totalScores = new ArrayList();
			StringTokenizer st = new StringTokenizer(cases, " ");
			noOfGooglers = Integer.parseInt(st.nextToken());
			noOfSurprisingTrip = Integer.parseInt(st.nextToken());
			topScore = Integer.parseInt(st.nextToken());
			while (st.hasMoreTokens()) {
				totalScores.add(st.nextToken());
			}
			int total;
			int triplet;
			int remainder;
			ArrayList<Number> triplets;
			ArrayList<ArrayList<Number>> dancers = new ArrayList<ArrayList<Number>>();
			int c = 0;
			for (Object t : totalScores) {
				triplets = new ArrayList<Number>();
				total = Integer.parseInt(t.toString());
				triplet = total / 3;
				remainder = total % 3;
				triplets.add(triplet);
				if (remainder == 2) {
					triplets.add(triplet + 1);
					triplets.add(total - (triplet * 2 + 1));
				} else {
					triplets.add(triplet);
					triplets.add(total - triplet * 2);
				}
				dancers.add(triplets);
			}
//			System.out.println(dancers);

			analyzeSurprises(dancers, noOfSurprisingTrip, topScore);

			System.out.println("Case #" + i + ": " + count);

		}

	}

	private static void analyzeSurprises(ArrayList<ArrayList<Number>> dancers,
			int noOfSurprisingTrip, int topScore) {
		// TODO Auto-generated method stub

		for (ArrayList<Number> list : dancers) {

			if (max(list) >= topScore) {
				count++;
			} else if (noOfSurprisingTrip > 0 && checkForSurprise(list,topScore)) {
				noOfSurprisingTrip--;
				count++;

			}
		}

	}

	private static boolean checkForSurprise(ArrayList<Number> list, int topScore) {
		// TODO Auto-generated method stub
		int topScoreCount = 0;
		for (Number n : list) {
			if (n.intValue()==topScore-1){
				topScoreCount++;	
			}
		}
		if (topScoreCount>=2 && topScore!=1)
		{
			return true;
		}
		
		return false;
	}

	private static int max(ArrayList<Number> list) {
		// TODO Auto-generated method stub
		int max = 0;
		for (Number n : list) {
			if (n.intValue() > max) {
				max = n.intValue();
			}
		}
		return max;
	}

}
