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 CodeJam2;

import java.io.*;
import java.util.HashMap;
import java.util.Scanner;

/**
 *
 * @author Ivan du Toit <s29363412>
 */
public class CodeJam2 {
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        BufferedReader fIn = null;
        PrintWriter fOut = null;
        try {
            fIn = new BufferedReader(new FileReader("in.txt"));
            fOut = new PrintWriter(new FileWriter("out.txt"));
            
        } catch (IOException e) {
            System.out.println("Invalid file given for output.");     
            System.exit(200);
        }
        
        Scanner in = new Scanner(fIn);
        int numberOfCases = Integer.parseInt(in.nextLine());
        
        for (int c=0; c<numberOfCases; c++) {
            fOut.print("Case #" + (c+1) + ": ");
            int numGoogs = in.nextInt();
            int numSuprises = in.nextInt();
            int bestScore = in.nextInt();
            int result = 0;
            for (int pos=0; pos<numGoogs; pos++) {
                int total = in.nextInt();
                int num = (int) Math.floor(total/3);
                int res = total % 3;
                //res = (res  > 1) ? 1 : res; 
                //boolean resBiggerThan1 = (res  > 1);
                boolean resLessThan1 = (res < 1);
                if (num >= bestScore)
                    result++;
                else if ((!resLessThan1) && (num + 1 >= bestScore))
                    result++;
                else if ((numSuprises > 0) && (num > 0) && ((resLessThan1 && (num + 1 >= bestScore)) || (!resLessThan1 && (num + res >= bestScore)))) {
                    numSuprises--;
                    result++;
                }
                else if ((numSuprises > 0) && (!resLessThan1 && (num + res >= bestScore))) {
                    numSuprises--;
                    result++;
                }
            }
            in.nextLine();
            fOut.println(result);
        }
        fOut.flush();
    }
    
    
}
