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.util.Scanner;

/**
 *
 * @author krishna
 */
public class Dance {
    
    public static void main(String [] args)
    {
        Program();
    }
    public static void Program()
    {
        Scanner inp=new Scanner(System.in);
        String patt[];
        int count;
        String line;
       // System.out.println("Test Case ");
                
        int test=Integer.parseInt(inp.nextLine());
        int num=1;
        int S,N,P;
        int judge1,judge2,judge3,rem;
        int Score[]=new int[100];
        while(num<=test)
        {
           // System.out.println("pattern ");
            
            line=inp.nextLine();
            patt=line.split(" ");
            
                N=Integer.parseInt(patt[0]);
                S=Integer.parseInt(patt[1]);
                P=Integer.parseInt(patt[2]);
                count=0;
                for(int i=0;i<N;i++)
                {
                    Score[i]=Integer.parseInt(patt[i+3]);
                    judge1=judge2=judge3=Score[i]/3;
                    rem=Score[i]%3;
                    if(Score[i]==0 )
                    {
                        if(P==0)
                           count++;
                        
                      // System.out.println(judge1+" "+judge2+" "+ judge3);
                    }
                    else if( rem==0  )
                    {
                       if(judge1 >= P)
                           count++;
                       else if( S > 0 && (judge1 + 1)>=P )
                       { 
                           judge1++;
                           judge2--;
                           count++;
                           S--;
                       }
                       // System.out.println(judge1+" "+judge2+" "+ judge3);
                    }
                    else if(rem==1)
                    {
                        judge1++;
                        if(judge1 >= P)
                        {
                           count++;
                        }
                      
                      // System.out.println(judge1+" "+judge2+" "+ judge3);
                        
                    }
                    else if(rem==2)
                    {
                        judge1++;
                        judge2++;
                       if( (judge1 )>=P)
                       {
                           count++;
                       }
                       else if( S!=0  && ((judge1)+1)>=P)
                        {
                           S--;
                           judge1++;
                           judge2--;
                           count++;
                        }
                      
                    //  System.out.println(judge1+" "+judge2+" "+ judge3);
                    }
                } 
                System.out.println("Case #"+num+": "+count);
             num++;
        }
    }
}
