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();
  }


}

import com.sun.org.apache.bcel.internal.generic.AALOAD;

import java.io.IOException;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class RecycledNum extends JamProblem {
    public static void main(String[] args) throws IOException {
        RecycledNum p = new RecycledNum();
        p.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        RecNCase ca = (RecNCase) jamCase;
        int res = 0;
        for (int n = ca.A; n < ca.B; n++) {
            String m = "";
            //print("n "+n);
            Set<Integer> bag = new HashSet<>();
            int length = intLength(n);
            for (int t = 1; t < length; t++) {
                int pow = (int) Math.pow(10, t);
                int pow2 = (int) Math.pow(10,length-t);
                int f = (n / pow);
                int s = n - (pow * f);
                int cand = f + (pow2 * s);
                //print("m " + cand);
                if (cand < ca.A || cand > ca.B || cand <= n) {
                    continue;
                }
                if (bag.contains(cand)) {
                    continue;
                }
                if (intLength(cand) != intLength(n)) {
                    continue;
                }
                res++;
                bag.add(cand);
                //print(""+ n+ " " + cand);
            }
        }
        return "" + res;
    }

    private void print(String m) {
        System.out.println(m);
    }

    private int intLength(int n) {
        return Integer.toString(n).length();
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        RecNCase ca = new RecNCase();
        ca.lineCount = 1;
        String s = file.get(line);
        int[] ints = JamUtil.parseIntList(s, 2);
        ca.A = ints[0];
        ca.B = ints[1];
        return ca;
    }
}

class RecNCase extends JamCase {
    int A, B;
}
