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 codejam.morl99.b;

import java.io.BufferedReader;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

import codejam.morl99.a.ProblemA;

public class ProblemB {
    public void solveSet(PrintWriter pw, BufferedReader reader) throws IOException {

        String firstLine = reader.readLine();
        Scanner scanner = new Scanner(firstLine);
        scanner.useDelimiter(" ");
        int T = scanner.nextInt();
        
        for (int i = 1; i <= T; i++) {
            scanner = new Scanner(reader.readLine());
            scanner.useDelimiter(" ");
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int[] t = new int[N];
            for (int googler = 0; googler < N; googler++) {
                t[googler] = scanner.nextInt();
            }
            System.out.println("-- N: " + N + " S: " + S + " p>="+p +" t:"+ Arrays.toString(t)  ) ;
            int solution = solveLine(N,S,p,t);
            pw.printf("Case #%d: %d",i,solution);
            pw.println();
        }
        
    }
    
    public int solveLine(int N, int S, int p, int[] t) {
        int casesAbove = 0;
        for (int i = 0; i < N; i++) {
            if (isRegularScoreAbove(t[i], p)) {
                casesAbove++;
                continue;
            }
            
            //Whenever a regular score is not above the limit, but the best surprising distribution is
            //we take the greedy approach and assume this was a surprising score. What better than a score above 
            //could we hope for?
            if (S > 0 && isSurprisingScoreAbove(t[i], p)) {
                S--;
                casesAbove++;
            }
        }
        return casesAbove;
    }
    
    public boolean isRegularScoreAbove(int ti, int p) {
        //This is the formular for the best score that can be achieved, if no score can be
        //apart more than 1 from any other score
        int best = ti/3 + Math.min(ti%3,1);
        System.out.println("Best regular score for "  + ti + " is " + best);
        return best >= p;
    }
    
    public boolean isSurprisingScoreAbove(int ti, int p) {
        //integer division, which is exactly what we want!
        int b = ((ti-1) / 3);
        int best = b + 1 + (ti-b*3+1)/3;
        //Special case, that we are near zero...
        best = Math.min(ti,best);
        System.out.println("Best surprising score for "  + ti + " is " + best);
        return best >= p;
    }
    
    public static void main(String[] args) throws IOException {
        ProblemB p = new ProblemB();
        
        OutputStream output = new FileOutputStream("res/B.out", false);
        PrintWriter pw = new PrintWriter(output);
        BufferedReader reader = new BufferedReader(new FileReader("res/B-large.in"));
        p.solveSet(pw, reader);
        pw.close();
        reader.close();
        
        
    }
}
