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 com.gmail.bubby4j.cj2012.qual2;

import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		//Begin--------------------------------------------------------------------------
		Scanner scanner = null;
		String inputfile = "C:\\Users\\James\\CodeJam2012\\B-large.in";
		String outputfile = "C:\\Users\\James\\CodeJam2012\\large.out";
		BufferedWriter out = null;
		Integer numcases = 0;
		try {
			out = new BufferedWriter(new FileWriter(outputfile));
		} catch (IOException e1) {
			e1.printStackTrace();
		}
		try {
			scanner = new Scanner(new FileInputStream(inputfile));
		} catch (FileNotFoundException e) {
			System.out.println("File not found!");
			System.exit(1);
		}
		Integer thisCase = 1;
		Boolean gotCase = false;
		while(scanner.hasNext()){
			String line = scanner.nextLine();
			if(isInteger(line) && !gotCase){
				numcases = Integer.parseInt(line);
				gotCase = true;
			}else{
				System.out.println("Case #"+thisCase);
				if(thisCase < numcases){
					appendOut("Case #" + thisCase + ": "+score(line)+"\n", out);
				}else{
					appendOut("Case #" + thisCase + ": "+score(line), out);
				}
				thisCase++;
			}
		}
		try {
			out.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
		System.out.println("Complete!");
		//End----------------------------------------------------------------------------
	}
	
	

	private static String score(String line) {
		String[] parts = line.split(" ");
		Integer ngooglers = Integer.parseInt(parts[0]);
		Integer suprising = Integer.parseInt(parts[1]);
		Integer bestresult = Integer.parseInt(parts[2]);
		ArrayList<Integer> scores = new ArrayList<Integer>();
		for (int i = 0; i < ngooglers; i++){
		    scores.add(Integer.parseInt(parts[i+3]));
		}
		//End parsing line
		Integer maxnumbers = 0;
		for (Integer score: scores) {
			Integer[] thisguess = new Integer[]{0,0,0};
			Integer baseNumber = intDivision(score, 3);
			thisguess[0] = baseNumber;
			thisguess[1] = baseNumber;
			thisguess[2] = baseNumber;
			Integer addingTo = 0;
			while(addArray(thisguess) < score){
				thisguess[addingTo]++;
				addingTo++;
			}
			thisguess = reverseArray(thisguess);
			
			
			String sup = "";
			//After all applying
			if(bestScore(thisguess) >= bestresult){
				maxnumbers++;
			}else if(suprising > 0 && canSuprise(thisguess)){
				//Isn't at or past the top, try to make suprising
				Integer[] suprised = suprise(thisguess);
				if(bestScore(suprised) >= bestresult){
					maxnumbers++;
					suprising--;
					thisguess = suprised;
					sup = " (*)";
				}
			}
			System.out.println(thisguess[0] + " " + thisguess[1] + " " + thisguess[2] + sup);
		}
		// return maximum number of Googlers who could have had a best result of 
		// 									 greater than or equal to bestresult
		return Integer.toString(maxnumbers);
	}

	public static boolean canSuprise(Integer[] scores){
		if((scores[2] == scores[1] && scores[0]+1 == scores[1]) || (scores[0] == scores[1] && scores[2] - 1 == scores[1]) || (scores[0] == scores[1] && scores[1] == scores[2] && scores[0] != 0)){
			return true;
		}
		return false;
	}
	
	public static Integer[] suprise(Integer[] in){
		Integer[] in2 = in.clone();
		if(in[2] == in2[1] && in2[0]+1 == in2[1]){
			in2[2]++;
			in2[1]--;
			return in2;
		}else if(in2[0] == in2[1] && in2[2] - 1 == in2[1]){
			in2[1]++;
			in2[0]--;
			return in2;
		}else if(in2[0] == in2[1] && in2[1] == in2[2] && in2[0] != 0){
			in2[0]--;
			in2[2]++;
			return in2;
		}
		return null;
	}
	
	public static Integer bestScore(Integer[] thisguess){
		Integer currentBest = 0;
		for (Integer score: thisguess) {
			if(score > currentBest){
				currentBest = score;
			}
		}
		return currentBest;
	}
	public static Integer addArray(Integer[] list){
		Integer tally = 0;
		for (Integer score: list) {
				tally += score;
		}
		return tally;
	}
	public static Integer[] reverseArray(Integer[] list){
		for(int i = 0; i < list.length / 2; i++){
			int temp = list[i];
		    list[i] = list[list.length - i - 1];
		    list[list.length - i - 1] = temp;
		}
		return list;
	}
	
	public static Integer intDivision(Integer i1, Integer i2){
		//Rounds down integer division
		return (int) Math.floor(i1/i2);
	}

	public static boolean isInteger(String i){
		try{
			Integer.parseInt(i);
			return true;
		}catch(Exception e){
			return false;
		}
		
	}
	public static void appendOut(String str, BufferedWriter out){
		try {
			out.append(str);
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
}
