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 dancing.with.the.googlers;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author B4dT0bi
 */
public class DancingWithTheGooglers
{

    public static String [] input;
    public static String wholeOutput="";
    public static void readInput(String inputFile)
    {
        BufferedReader br = null;
        try
        {
            br = new BufferedReader(new FileReader(inputFile));
            String serializedSettings = "";
            String line = null;
            while ((line = br.readLine()) != null)
                serializedSettings += line + "\n";
            input=serializedSettings.split("\n");
            br.close();
        } catch (Exception ex)
        {
            Logger.getLogger(DancingWithTheGooglers.class.getName()).log(Level.SEVERE, null, ex);
        } finally
        {
            try
            {
                br.close();
            } catch (IOException ex)
            {
                Logger.getLogger(DancingWithTheGooglers.class.getName()).log(Level.SEVERE, null, ex);
            }
        }
    }
    public static void writeOutput(String inputFile)
    {
        try
        {
            BufferedWriter out = new BufferedWriter(new FileWriter(inputFile+".out"));
            out.write(wholeOutput);
            out.close();
        } catch (IOException e)
        {
            e.printStackTrace();
        }

    }
    public static void main(String[] args)
    {
        readInput(args[0]);
        
        wholeOutput="";
        for(int i=1;i<input.length;i++)
        {
            String[] in=input[i].split(" ");
            int nrGooglers=Integer.parseInt(in[0]);
            int surResult=Integer.parseInt(in[1]);
            int bestResult=Integer.parseInt(in[2]);
            int [] googlerPoints=new int[in.length-3];
            for(int n=3;n<in.length;n++)
            {
                googlerPoints[n-3]=Integer.parseInt(in[n]);
            }
            int anzBest=0;
            for(int n=0;n<googlerPoints.length;n++)
            {
                if(win(googlerPoints[n], bestResult, false))
                {
                    anzBest++;
                }
                else
                {
                    if(surResult>0)
                    {
                        if(win(googlerPoints[n], bestResult, true))
                        {
                            anzBest++;
                            surResult--;
                        }
                    }
                }
            }
            wholeOutput+="Case #"+i+": "+anzBest+"\n";
        }
        writeOutput(args[0]);
        
    }
    static HashMap<Integer,ArrayList>results=new HashMap<Integer, ArrayList>();
    public static boolean win(int result,int best,boolean surprise)
    {
        if(!results.containsKey(result))
        {
            results.put(result, getResults(result));
        }
        ArrayList<ArrayList>tmp=results.get(result);
        for(int i=0;i<tmp.size();i++)
        {
            ArrayList<Integer>tmp2=tmp.get(i);
            int max=tmp2.get(0);
            int sur=tmp2.get(1);
            if(sur==0)
            {
                if(max>=best)return true;
            }
        }
        if(surprise)
        for(int i=0;i<tmp.size();i++)
        {
            ArrayList<Integer>tmp2=tmp.get(i);
            int max=tmp2.get(0);
            int sur=tmp2.get(1);
            if(sur==1)
            {
                if(max>=best)return true;
            }
        }
        return false;
    }
    private static ArrayList getResults(int res)
    {
        ArrayList<ArrayList>tmp=new ArrayList<ArrayList>();
        HashSet<String>mySet=new HashSet<String>();
        for(int a=0;a<11;a++)
        {
            for(int b=0;b<11;b++)
            {
                for(int c=0;c<11;c++)
                {
                    if(a+b+c==res)
                    {
                        int min=a;
                        if(b<min)min=b;
                        if(c<min)min=c;
                        int max=a;
                        if(b>max)max=b;
                        if(c>max)max=c;
                        if(max-min<=2)
                        {
                            ArrayList<Integer>tmp2=new ArrayList<Integer>();
                            tmp2.add(max);
                            if(max-min==2)
                            {
                                tmp2.add(1);
                            }
                            else
                            {
                                tmp2.add(0);
                            }
                            if(!mySet.contains(""+max+";"+tmp2.get(1)))
                            {
                                mySet.add(""+max+";"+tmp2.get(1));
                                tmp.add(tmp2);
                            }
                        }
                    }
                }
            }
        }
        return tmp;
    }
}

