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 IO;

/**
 *
 * @author dannocz
 */
public class TestCase {
    
    private int noGooglers;
    private int p;
    private Googler[] googlers;

    public TestCase(String testCase) {
        String[] cads=testCase.split(" ");
        noGooglers = Integer.parseInt(cads[0]);
        int surprisedCases = Integer.parseInt(cads[1]);
        p = Integer.parseInt(cads[2]);
        googlers= new Googler[noGooglers];
        
        for (int i = 0; i < noGooglers; i++) {
            int score=Integer.parseInt(cads[i+3]);
            googlers[i]=new Googler(score, surprisedCases);
            buildTripplets(googlers[i]);
        }
        
    }

    
    public TestCase(int noGooglers, int surprisedCases, int p) {
        this.noGooglers = noGooglers;
        this.p = p;
        this.googlers= new Googler[noGooglers];
    }
    
   
    
    public int result(){
        int total=0;
        for (Googler googler : googlers) {
            if(googler.result(p))
                total++;
        }
        
        return total;
    }

    private void buildTripplets(Googler googler) {
        
        int score = googler.getScore();        
        for(int hp = p; hp<=10; hp++)
        {
            int x= score-hp;
            for(int y1=0;y1<=hp;y1++){
            //for(int y1=hp;y1>=hp-2;y1--){
                int y2 = x-y1;
                if(validTripplet(score,hp,y1,y2))
                    googler.addTriplet(new Triplet(hp,y1,y2));
            }
        }               
    }

    private boolean validTripplet(int score,int hp, int y1, int y2) {
        
        return (hp+y1+y2)==score &&
                validPair(hp,y1) && validPair(hp,y2) && validPair(y1,y2);
        
    }
    
    private boolean validPair(int y1, int y2){
          
        if(y1<0 || y2<0 || y1>10 || y2>10)
            return false;
        
        int r= y1-y2;
        return (r<=2 && r>=-2);
    }
}