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

import com.google.common.base.Function;
import com.google.common.base.Predicate;
import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.Arrays;
import java.util.List;

/**
 * Hello world!
 *
 */
public class Main {

    static BufferedReader in;
    static BufferedWriter out;
    static String inputFile = "in.txt";
    static String outputFile = "outfile.txt";

    private static class Parser {

        public final int numDancers;
        public final int numSurprises;
        public final int minScore;
        public final int index;
        public final int answer;

        public Parser(String line, int ix) {
            index = ix;
            List<String> parts = Lists.newArrayList(Arrays.asList(line.split(" ")));
            numDancers = Integer.parseInt(parts.remove(0));
            numSurprises = Integer.parseInt(parts.remove(0));
            minScore = Integer.parseInt(parts.remove(0));
            
            Iterable<Dancer> dancers = Iterables.transform(parts, new Function<String, Dancer>() {

                public Dancer apply(String f) {
                    return new Dancer(Integer.parseInt(f), minScore);
                }
            });

            int winners = Iterables.size(Iterables.filter(dancers, new Predicate<Dancer>() {

                public boolean apply(Dancer t) {
                    return t.win();
                }
            }));

            int surprises = Math.min(Iterables.size(Iterables.filter(dancers, new Predicate<Dancer>() {

                public boolean apply(Dancer t) {
                    return t.possibleSurprise();
                }
            })), numSurprises);
                        
            answer = winners + surprises;
        }

        public String output() {
            return "Case #" + index + ": " + answer;
        }
    }

    private static class Dancer {

        public final int score;
        public final int minScore;
        public final int remainder;
        public final int average;

        public Dancer(int scr, int min) {
            score = scr;
            minScore = min;
            remainder = scr % 3;
            average = scr / 3;
        }

        // If remainder = 0, we either have 3 * avg or avg - 1 & avg & avg + 1 (surprising)
        // If remainder = 1, we either have avg-1 & 2 * avg+1 (surprising) or 2 * avg & avg + 1
        // If remainder = 2, we either have 2 * avg & avg + 2 (surprising) or avg & 2 * avg + 1
        public boolean win() {
            if (remainder == 0) {
                return average >= minScore;
            } else {
                return average >= minScore - 1;
            }
        }

        public boolean possibleSurprise() {
            if (win()) {
                return false;
            }
            if (remainder == 0) {
                return average > 0 && average == minScore - 1;
            } else if (remainder == 1) {
                return false;
            } else {
                return average == minScore - 2;
            }
        }
    }

    public static void main(String[] args) throws Exception {

        in = new BufferedReader(new FileReader(inputFile));
        out = new BufferedWriter(new FileWriter(outputFile));
        try {
            String line = in.readLine();
            int nbCases = Integer.parseInt(line);
            int index = 0;
            while ((line = in.readLine()) != null) {
                index++;
                Parser p = new Parser(line, index);
                out.write(p.output());
                out.newLine();
            }
        } finally {
            in.close();
        }
        out.flush();
    }
}
