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


}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package qualification.Dancing;

import java.util.*;

/**
 *
 * @author farshid
 */
public class Dancing {

    public Dancing() {
    }

    public int solve(String problem) {
        String[] arr = problem.split(" ");

        int n = Integer.parseInt(arr[0]);
        int s = Integer.parseInt(arr[1]);
        int p = Integer.parseInt(arr[2]);
        int[] scores = new int[arr.length - 3];

        for (int i = 3; i < arr.length; i++) {
            scores[i - 3] = Integer.parseInt(arr[i]);
        }

        LinkedList<LinkedList<Combination>> combs =
                new LinkedList<LinkedList<Combination>>();

        for (int i = 0; i < scores.length; i++) {
            LinkedList<Combination> l = this.dancerPossibleCombs(scores[i], p);
            combs.add(l);
        }

        int max = this.processCombination(combs, s);

        return max;
    }

    public void test() {
    
    }

    private int processCombination(LinkedList<LinkedList<Combination>> combs, int maxSur) {

        int max = 0;
        int currentSur = 0;

        for (int i = 0; i < combs.size(); i++) {
            LinkedList<Combination> current = combs.get(i);
            boolean increased = false;
            
            for (int j = 0; j < current.size(); j++) {
                if (!current.get(j).isSurprising()){
                    max++;
                    increased = true;
                    break;
                }
            }
            
            if (!increased && !current.isEmpty() && currentSur < maxSur){
                max++;
                currentSur++;
            }
        }

        return max;
    }

    private LinkedList<Combination> dancerPossibleCombs(int total, int p) {

        LinkedList<Combination> list = new LinkedList<Combination>();

        // Get all possible combs
        for (int i = 0; i <= 10; i++) {

            if ((i + 2) >= p && (3 * i) + 4 >= total) { // otherwise no possible/useful combination

                // 8 possible combs
                if (3 * i == total && i >= p) {
                    Combination c = new Combination(
                            new int[]{i, i, i}, false);
                    list.add(c);
                    continue;
                }
                if ((3 * i + 1) == total && (i + 1) >= p) {
                    Combination c = new Combination(
                            new int[]{i, i, i + 1}, false);
                    list.add(c);
                    continue;
                }

                if ((3 * i + 2) == total) {
                    if (i + 2 >= p) {
                        Combination c1 = new Combination(
                                new int[]{i, i, i + 2}, true);
                        list.add(c1);
                    }
                    if (i + 1 >= p) {
                        Combination c2 = new Combination(
                                new int[]{i, i + 1, i + 1}, false);

                        list.add(c2);
                    }

                    continue;
                }

                if (3 * i + 3 == total && (i + 2) >= p) {
                    Combination c = new Combination(
                            new int[]{i, i + 1, i + 2}, true);
                    list.add(c);
                    continue;
                }

                if (3 * i + 4 == total && (i + 2) >= p) {
                    Combination c1 = new Combination(
                            new int[]{i, i + 2, i + 2}, true);
                    list.add(c1);
                }
            }
        }

        return list;

    }
}
