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

import custom.Output;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 *
 * @author shyam
 */
public class B {
    //static String inputfile="./src/Small.in";
    //static String outputfile="./src/Small.out";
    static String inputfile="./src/Large.in";
    static String outputfile="./src/Large.out";

     public static void main(String args[])throws Exception{
        BufferedReader br=new BufferedReader(new FileReader(inputfile));
        PrintWriter pw = new PrintWriter(new FileWriter(outputfile));

        String row="";
        StringTokenizer st;

        // first line to count no of records
        row=br.readLine();
        int T=Output.ipri(row);

        
        // initial variables


        for(int count=1;count<=T;count++){
            row=br.readLine(); // read each record
            // tokenize: default space
            st=new StringTokenizer(row);
            int N = Output.ipri(st.nextToken());
            int S = Output.ipri(st.nextToken());
            int p = Output.ipri(st.nextToken());



            // variables
            int GT;
            int x,y,z;
            int sup=0;
            int[][] G = new int[N][3];
            // operations

            for(int i=0;i<N;i++){
                GT = Output.ipri(st.nextToken());
                x = Math.min(GT, GT/3 + Math.max(GT%3, 1));
                if(x==11) x=10;
                y = GT/3;
                z = GT-x-y;
                G[i][0] = x;
                G[i][1] = y;
                G[i][2] = z;
                if(x-z == 2) sup++;
                //Output.sopl(x+" "+y+" "+z);
            }

            java.util.Arrays.sort(G, new java.util.Comparator<int[]>() {
                public int compare(int[] a, int[] b) {
                    return b[0] - a[0];
                }
            });

            int max_G = 0;

            for(int i=N-1;i>=0;i--){
                if( G[i][0] == p ) break;

                if(sup > S && (G[i][0]-Math.min(G[i][1],G[i][2]))==2){
                    G[i][0]--;
                    G[i][2]++;
                    sup--;
                    
                }
            }
            for(int i=0;i<N;i++){
                if(sup > S && (G[i][0]-Math.min(G[i][1],G[i][2]))==2){
                    G[i][0]--;
                    G[i][2]++;
                    sup--;

                }
                if(G[i][0] >= p)
                   max_G++;
            }

            // printing output
            //Output.sopl("Case #"+count+": "+max_G);
            pw.println("Case #"+count+": "+max_G);


            // reset variables

        }

        br.close();
        pw.close();
    }

}
