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.File;
import java.io.FileReader;
import java.util.Scanner;

/**
 *
 * @author Gershom
 */
public class DancingWithGooglers {

    public static void main(String[] args0) {
        try {
            File f = new File("example");
            Scanner s = new Scanner(new FileReader(f));
            int num = Integer.parseInt(s.nextLine());
            for (int i = 0; i < num; i++) {
                String line = s.nextLine();
                int[] dat = new int[3];
                intList(line, dat);
                int numGooglers = dat[0];
                int numSurprising = dat[1];
                int p = dat[2];
                int[] scoresTemp = new int[3 + numGooglers];
                intList(line, scoresTemp);
                int[] scores = new int[numGooglers];
                for (int j = 0; j < scores.length; j++) {
                    scores[j] = scoresTemp[j + 3];
                }
                
                System.out.println("Case #" + (i + 1) + ": " + 
                        calcNumBest(numSurprising, p, scores));
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    static int calcNumBest(int sur, int p, int[] scores) {
        int numSurprisingRequired = 0;
        int num = 0;
        
        for (int i = 0; i < scores.length; i++) {
            switch (scoreBreakdown(scores[i], p)) {
                case 1:
                    numSurprisingRequired++;
                    break;
                case 2:
                    num++;
                    break;
            }
        }
        
        return num + Math.min(sur, numSurprisingRequired);
    }
    
    /**
     * 0 means target can't be met, 1 means it can be met if it's "surprising",
     * 2 means it can be met without being surprising.
     * @param best
     * @return 
     */
    static int scoreBreakdown(int score, int target) {
        //Remaining points assuming target was met
        int rem = score - target;
        
        if (rem < 0) {
            return 0;
        }
        
        int otherScores = rem / 2;
        
        int gap = target - otherScores;
        if (gap > 2) {
            return 0;
        } else if (gap == 2) {
            return 1;
        }
        return 2;
    }
    
    public static void intList(String s, int[] array) {
        int index = 0;
        String cur = "";
        for (int i = 0; i < s.length() + 1; i++) {
            if (i == s.length() || s.charAt(i) == ' ') {
                array[index++] = Integer.parseInt(cur);
                if (index == array.length) {
                    break;
                }
                cur = "";
            } else {
                cur += s.charAt(i);
            }
        }
    }
}
