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 java.io.IOException;
import java.util.*;

public class AlienLanguage extends JamProblem {
    private int wordsC;
    private int wordsL;
    List<String> words = new ArrayList<String>();
    TreeNode startNode;

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

    @Override
    void parseFirstLine(List<String> file) {
        int[] firstLine = JamUtil.parseIntList(file.get(0), 3);
        caseCount = firstLine[2];
        wordsC = firstLine[1];
        wordsL = firstLine[0];
        startNode = new TreeNode(null);
        for (int i=0; i<wordsC; i++) {
            String word = file.get(i + 1);
            words.add(word);
            buildTree(word, startNode);
        }
        lastLine = wordsC + 1;
    }

    @Override
    String solveCase(JamCase jamCase) {
        ALCase cas = (ALCase) jamCase;
        Set<TreeNode> curr = new HashSet<>();
        curr.add(startNode);
        List<Set<Character>> pattern = cas.pattern;
        for (int i = 0; i < pattern.size(); i++) {
            Set<Character> characters = pattern.get(i);
            Set<TreeNode> next = new HashSet<>();
            for (Character ch : characters) {
                for (TreeNode node : curr) {
                    if (node.childred.containsKey(ch)) {
                        next.add(node.childred.get(ch));
                    }
                }
            }
            curr = next;
        }
        return "" + curr.size();
    }

    @Override
    JamCase parseCase(List<String> file, int lineI) {
        ALCase cas = new ALCase();
        cas.lineCount = 1;
        String line = file.get(lineI);
        boolean inGroup = false;
        char[] chars = line.toCharArray();
        Set<Character> current = new HashSet<>();
        for (int i = 0; i < chars.length; i++) {
            char ch = chars[i];
            switch (ch) {
                case '(':
                    inGroup = true;
                    current = new HashSet<>();
                    cas.pattern.add(current);
                    break;
                case ')':
                    inGroup = false;
                    break;
                default:
                    if (inGroup) {
                        current.add(ch);
                    } else {
                        current = new HashSet<>();
                        cas.pattern.add(current);
                        current.add(ch);
                    }
            }
        }
        return cas;
    }

    void buildTree(String str, TreeNode node) {
        char c = str.charAt(0);
        String remain = str.substring(1);
        if (node.childred.get(c) == null) {
            TreeNode newNode = new TreeNode(c);
            node.childred.put(c,newNode);
        }
        if (!remain.isEmpty()) {
            buildTree(remain,node.childred.get(c));
        }
    }
}

class ALCase extends JamCase {
    TreeNode startNode = new TreeNode(null);
    List<Set<Character>> pattern = new ArrayList<Set<Character>>();
}

class TreeNode {
    TreeNode(Character ch) {
        this.ch = ch;
    }

    Character ch;
    Map<Character,TreeNode> childred = new HashMap<Character, TreeNode>();
}


