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.io.*;
import java.util.*;

class d{
  File ffff;
  FileReader fr;
  BufferedReader br;
 
  File fout;       
  FileWriter fw;
  BufferedWriter bw; 
  
 public void run(){
    try{
        
   ffff=new File("C:\\Users\\Dimitris\\Documents\\NetBeansProjects\\jam\\src\\B-small-attempt0.in");
   fr=new FileReader(ffff);
   br=new BufferedReader(fr);
    
   fout=new File("C:\\Users\\Dimitris\\Documents\\NetBeansProjects\\jam\\src\\output.out");
   fw=new FileWriter(fout);
   bw=new BufferedWriter(fw);
        
    
    
    int ipol;
    int diair;
    
    int loop=new Integer(br.readLine());
    int ii=1;
    
   for(int j=0;j<loop;j++){
    int res=0;
    int fail=0;
    
    
    String ss=br.readLine();
    String [] b=ss.split(" ");
    int[]a=new int[b.length];
    for(int i4=0;i4<b.length;i4++) a[i4]=new Integer(b[i4]);
     
    int t=a[2];
    int f=a[1];
    
    for(int i=3;i<a.length;i++){
        
        diair=a[i]/3;
        ipol=a[i]%3;
         
        
        if(a[i]==0){
            if(t==0) res++;
            continue;
        }
        
        
        if(diair>=t){
            res++;
        }
        
        
        else{
         
           if(ipol==0){
               if(fail!=f){
                   int j1=diair+1;
                   if(j1>=t){
                   res++;
                   fail++;
                   continue;
                   }
               }
           }
           if(ipol==1){
               int j2=diair+1;
               if(j2>=t){
                   res++;
                   continue;
               }
           }
           
           if(ipol==2){
               int j3=diair+1;
               if(j3>=t){
                   res++;
                   continue;
               }
               
               if(fail!=f){
                   int j4=diair+2;
                   if(j4>=t){
                   res++;
                   fail++;
                   continue;
                   }
               }
           }
           
           if(ipol>2) continue;
            
        }
             
    }//for
    String r=Integer.toString(res);
    bw.write("Case #"+ii+": "+r);
    bw.write('\n');
    ii++;
    
   }
   bw.close();
   br.close();
   }
    catch(Exception e){
        e.printStackTrace();
    }
 
    
}  //run
 
   
 public static void main(String[]args){
     d dd=new d();
     dd.run();
        
 }
} //class
