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

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;


/**
 *
 * @author Fred
 */
public class CodeJam2012PA 
{

    /**
     *         type entrada.txt | java -jar Programa.jar > saida.txt
     */
    public static void main(String[] args) throws Exception 
    {        

        BufferedReader buf = new BufferedReader(new InputStreamReader(System.in));
        String line = buf.readLine();

        
        int j = 1;
        while((line = buf.readLine()) != null)
        {
            String[] str = line.split(" ");

            int n = Integer.valueOf(str[0]);
            int s = Integer.valueOf(str[1]);
            int p = Integer.valueOf(str[2]);

            ArrayList<Integer> triplets = new ArrayList<Integer>();
            for (int i = 0; i < n; i++) 
            {
                triplets.add(Integer.valueOf(str[3+i]));
            }

            System.out.println("Case #"+j+": "+calcula(s, p, triplets));
            j++;
        }      
    }
    
    public static String calcula(int s, int p, ArrayList<Integer> t)
    {
        int count = 0;
        int sused = 0;
        for(Integer i : t)
        {
            if(i == 0)
            {
                if(p <= 0)
                    count++;
            }
            else if(i == 1)
            {
                if(p <= 1)
                    count++;
            }
            else if(i == 2)
            {
                if(p <= 1)
                    count++;
                else
                {
                    if(p <= 2)
                    {
                        count++;
                        sused++;
                    }
                }
            }
            else if(i == 3)
            {
                if(p <= 1)
                    count++;
                else
                {
                    if(p <= 2)
                    {
                        count++;
                        sused++;
                    }
                }
            }
            else if(i % 3 == 2) //numero 11
            {
                if( (i/3) + 1 >= p)
                    count++;
                else if((i/3) + 2 >= p)
                {
                    sused++;
                    count++;
                }
            }
            else if(i % 3 == 1) // 10
            {
                if((i/3) + 1 >= p)
                    count++;
            }
            else if(i % 3 == 0) //9
            {
                if(i/3 >= p)
                    count++;
                else if((i/3) + 1 >= p)
                {
                    count++;
                    sused++;
                }
            }
        }

        int inv = sused - s;
        if(inv <= 0)
            return String.valueOf(count);
        return String.valueOf(count-inv);
    }

}
