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 qualr2012.problemB;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.LinkedList;
import java.util.TreeSet;
import java.util.logging.Logger;

import org.apache.commons.io.FileUtils;
import org.apache.commons.lang.ArrayUtils;
import org.springframework.util.Assert;

public class DancingWithGooglers {

	static Logger log = Logger.getLogger(DancingWithGooglers.class.getName());
	final static String inputFileName = "B-large.in";
	final static String outputFileName = "B-large.out";

	public static void main(String[] args) throws IOException {
		String pkgName = DancingWithGooglers.class.getPackage().getName().replaceAll("\\.", "/");
		String inputFile = "src/main/java/" + pkgName + "/" + inputFileName;
		String outputFile = "target/" + pkgName + "/" + outputFileName;
		FileUtils.forceMkdir(new File("target/" + pkgName));
		BufferedReader reader = new BufferedReader(new FileReader(inputFile));
		PrintWriter writer = new PrintWriter(outputFile);
		int numCase = Integer.parseInt(reader.readLine());
		
		int i, j;
		String[] str;
		
		int[] maxNoSurprise = new int [31];
		int[] maxSurprise = new int [31];
		
		for (i = 0; i < 31; ++i) {
			 maxNoSurprise[i] = (int)Math.ceil(i/3.0);
			 maxSurprise[i] = (int)Math.ceil(i/3.0 + 0.5);
		}
		maxSurprise[0] = 0;
		
		for(int _case = 1; _case <= numCase; ++_case) {
			LinkedList<Integer> t_LL = new LinkedList<Integer>();
			Integer[] t = null;
			str = reader.readLine().split(" ");
			
			
			int N, S, p;
			N = Integer.parseInt(str[0]);
			S = Integer.parseInt(str[1]);
			p = Integer.parseInt(str[2]);
			
			for (i = 3; i < str.length; ++i) {
				t_LL.add(Integer.parseInt(str[i]));
			}
			Collections.sort(t_LL);
			
			t = t_LL.toArray(new Integer[0]);
			
			Assert.isTrue(t.length == N);
			
			// move i to the first no-surprise triplet which has max score >= p
			for (i = 0; i < t.length; ++i) {
				if (maxNoSurprise[t[i]] >= p) { break; }
			}
			
			// for each available S, use it to maximize the number of Googlers to the left of i
			for (; i >= 1 && S > 0 && maxSurprise[t[i-1]] >= p; i--, S--) {
				
			}
			
			int answer = t.length - i;
			log.info(answer+"");
			
			writer.println("Case #" + _case + ": " + answer);
		}
		
		reader.close();
		writer.close();
	}

}
