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 cw.codejam;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;

class Dance_B {
	List<Bcase> cases = new ArrayList<>();
	
	private static class Bcase{
		int targetScore, surprises;
		List<Integer> totals = new ArrayList<>();
		int answer;
	}

	public static void main(String[] args) {
		Dance_B dance = new Dance_B();

		File infile = new File(args[0]);
		File outfile = new File(infile.getParent(), "b.out.txt");

		dance.parse(infile);
		dance.solve();
		dance.output(outfile);
	}

	/**
	 * Pop the highest sorted totals. Utilize surprise scores to achieve max spread for max results  
	 */
	void solve() {
		for(Bcase bcase : cases){
			//e.g.: desire 8, score=8 7 7
			int minBaseline = Math.max(bcase.targetScore * 3 - 2, 0);
			
			//e.g.: desire 8, score = 8 6 6
			int minSurpriseBaseline = Math.max(bcase.targetScore * 3 - 4, 0);
			
			//sort and build stack
			Collections.sort(bcase.totals);
			Stack<Integer> stack = new Stack<>();
			for(int i: bcase.totals){
				stack.push(i);
			}
			
			while(!stack.isEmpty()){
				//highest total on the stack
				int aScore = stack.pop();
				
				//special case for 0 total. A 0 total means each vote is 0
				if(aScore == 0 ){
					if(bcase.targetScore == 0){
						bcase.answer++;
					}
				} else if(aScore >= minBaseline){
					//done, easy spread
					bcase.answer++;
				} else if (bcase.surprises > 0){
					//attempt to use a surprise score
					if(aScore >= minSurpriseBaseline){
						bcase.surprises--;
						bcase.answer++;
					}
				}
			}
		}
	}

	void parse(File infile) {
		try (Scanner scanner = new Scanner(infile)) {
			int numCases = Integer.parseInt(scanner.nextLine());
			for (int i = 0; i < numCases; i++) {
				Bcase bcase = new Bcase(); 
				final int n = scanner.nextInt();
				bcase.surprises = scanner.nextInt();
				bcase.targetScore = scanner.nextInt();
				
				for(int x=0; x<n; x++){
					bcase.totals.add(scanner.nextInt());
				}
				cases.add(bcase);
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	void output(File outfile) {
		try (BufferedWriter bw = new BufferedWriter(new FileWriter(outfile))) {
			int i=1;
			for(Bcase bcase : cases){
				bw.write(String.format("Case #%d: %d\n", i++, bcase.answer));
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
