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

import java.io.File;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

import org.apache.commons.lang.ArrayUtils;

// Libraries used: http://commons.apache.org/lang/, http://commons.apache.org/collections/
public class B {

    private static boolean debugAllowed = true;
    private static Scanner scanner;
    private static int numberOfCases;
    private static int N;
    private static int[] t;
    private static long S;
    private static long p;

    private static void parseCase(int caseNumber) {
        debug("Case #" + caseNumber);

        N = scanner.nextInt();
        debug("    N: " + N);
        S = scanner.nextLong();
        debug("    S: " + S);
        p = scanner.nextLong();
        debug("    p: " + p);

        t = new int[N];
        for (int i = 0; i < N; i++) {
            t[i] = scanner.nextInt();
        }
        debug("    t: " + Arrays.asList(ArrayUtils.toObject(t)));
    }

    private static String solveCase() {
        int solution = 0;
        for (int i = 0; i < N; i++) {
            int base = (t[i] - 1) / 3;
            int remainder = (t[i] - 1) % 3 + 1;
            debug("    t[i]: " + t[i] + "\t base: " + base + "\t remainder: " + remainder);
            if (base * 3 + remainder != t[i]) {
                throw new RuntimeException();
            }

            if (remainder == 0) {
                if (base >= p) {
                    solution++;
                }
                debug("        " + base + ", " + base + ", " + base + "    (a)");
            } else if (remainder == 1) {
                if (base + 1 >= p) {
                    solution++;
                }
                debug("        " + base + ", " + base + ", " + (base + 1) + "    (b)");
            } else {
                if (base + 1 >= p) {
                    solution++;
                    if (remainder == 2) {
                        debug("        " + base + ", " + (base + 1) + ", " + (base + 1) + "    (c2)");
                    } else {
                        debug("        " + (base + 1) + ", " + (base + 1) + ", " + (base + 1) + "    (c3)");
                    }
                } else {
                    if (base + 2 >= p & S > 0) {
                        solution++;
                        S--;
                        if (remainder == 2) {
                            debug("        " + base + ", " + base + ", " + (base + 2) + "    (d2)");
                        } else {
                            debug("        " + base + ", " + (base + 1) + ", " + (base + 2) + "    (d2)");
                        }
                    } else {
                        if (remainder == 2) {
                            debug("        " + base + ", " + (base + 1) + ", " + (base + 1) + "    (e2)");
                        } else {
                            debug("        " + (base + 1) + ", " + (base + 1) + ", " + (base + 1) + "    (e3)");
                        }
                    }
                }
            }
        }

        return String.valueOf(solution);
    }

    public static void main(String[] args) throws Exception {
        File inputFile = new File(args[0]);
        String outputFileName = inputFile.getParent() + File.separator + inputFile.getName().replace(".in", ".out");
        PrintStream out = new PrintStream(outputFileName);

        scanner = new Scanner(inputFile);
        numberOfCases = Integer.valueOf(scanner.nextLine());
        debug(numberOfCases + " cases");

        long startTime = System.currentTimeMillis();
        for (int caseNumber = 1; caseNumber <= numberOfCases; caseNumber++) {
            parseCase(caseNumber);

            String solution = solveCase();

            String resultString = "Case #" + caseNumber + ": " + solution;
            out.println(resultString);
            debug("Solution for " + resultString);

            debug("");
        }
        long time = System.currentTimeMillis() - startTime;
        debug("Time: " + time + " ms (" + time / numberOfCases + " ms / case)");

        out.close();
    }

    private static void debug(String text) {
        if (debugAllowed) {
            System.out.println(text);
        }
    }
}
