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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map.Entry;
import java.util.Set;

public class CodeJam2
{

    private class Data
    {
        private int num;
        private int surprise;
        private int threshold;
        private Integer[] values;

        public Data(int num, int surprise, int threshold, Integer[] values)
        {
            this.num = num;
            this.surprise = surprise;
            this.threshold = threshold;
            this.values = values;
        }

        public int getNum()
        {
            return num;
        }

        public int getSurprise()
        {
            return surprise;
        }

        public int getThreshold()
        {
            return threshold;
        }

        public Integer[] getValues()
        {
            return values;
        }

        public String toString()
        {
            return num + " " + surprise + " " + threshold + " " + values.length;
        }
    }

    private List<Data> getInputValue()
    {
        List<Data> inpVal = new ArrayList<Data>();

        BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
        try
        {
            final String tc_ = stdin.readLine();
            Integer testCase = Integer.parseInt(tc_);

            while (testCase-- > 0)
            {
                // System.err.println("tc#" + testCase);
                final String[] input = stdin.readLine().split(" ");
                int num = Integer.parseInt(input[0]);
                Integer[] values = new Integer[num];

                for (int i = 3; i < input.length; ++i)
                    values[i - 3] = Integer.parseInt(input[i]);

                Data data = new Data(num, Integer.parseInt(input[1]), Integer.parseInt(input[2]), values);

                inpVal.add(data);

            }

            return inpVal;
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }

        return null;
    }

    private static int getMaxWOSurprise(int a)
    {
        if (a % 3 == 0)
            return a / 3;
        else
            return (a / 3) + 1;
    }

    private static int getMaxWithSurprise(int a)
    {
        if (a == 0)
            return -1;
        else if ((a % 3) == 0)
            return (a / 3) + 1;
        else if (a % 3 == 1)
            return -1;
        else
            return (a / 3) + 2;
    }

    private static Integer[] sort(Integer[] arr)
    {
        for (int i = 0; i < arr.length - 1; ++i)
            for (int j = i + 1; j < arr.length; ++j)
                if (arr[i] < arr[j])
                {
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
        return arr;
    }

    public static void main(String[] args)
    {
        CodeJam2 cj = new CodeJam2();
        List<Data> inp = cj.getInputValue();
        // System.err.println(inp);

        // System.err.println(getMaxWithSurprise(15));

        int count = 1;

        // operating for each tc
        for (Data data : inp)
        {
            int surprise = data.getSurprise();
            int threshold = data.getThreshold();
            int answer = 0;

            Integer[] scores = sort(data.getValues());

            for (Integer score : scores)
            {
                // System.err.println(score + " " + getMaxWithSurprise(score) +
                // " " + getMaxWOSurprise(score));

                if (getMaxWOSurprise(score) >= threshold)
                    answer++;
                else if (surprise > 0 && getMaxWithSurprise(score) >= threshold)
                {
                    answer++;
                    surprise--;
                }
            }

            System.out.println("Case #" + count++ + ": " + answer);
        }

        // System.err.println(cj.generateCombination(24, 40));
    }
}
