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();
  }


}


/**
 * Write a description of class dancing here.
 * 
 * @author (your name) 
 * @version (a version number or a date)
 */
import java.io.*;

public class dancing
{
    public static void main(String args[]) throws IOException
    {
        int tcase,ng,sur,max;
        int i, j, m, x, y=0,s,flag=0,sum,best,counter;
        int g[]=new int[100];
        char ch,newline=13;
        String result;
        FileInputStream fis;
        
        fis = new FileInputStream("B-large.in");
        
    
    DataInputStream dis = new DataInputStream(fis);
  BufferedReader br = new BufferedReader(new InputStreamReader(dis));
  

  File fout = new File("B-large-sol.op");
  FileOutputStream fo = new FileOutputStream(fout);

  byte buf[];

  
  String strline;

  strline = br.readLine();
  
  tcase = Integer.parseInt(strline);
 // System.out.println(tcase);
  for(m=1;m<=tcase;m++)
    {   
//System.out.println("testcase"+m);
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        ng=s;
        
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        sur=s;
        
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        max=s;
        
       
  //System.out.println(ng+" "+sur+" "+max);      
    for(i=0;i<ng;i++)
     {
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
  //      System.out.println(ch-48);
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        g[i]=s;
        
     }
    // System.out.println("scores are read!!!"+g[ng-1]);
    counter=0;
    for(i=0;i<ng;i++)
        {
     //       System.out.println(g[i]);     
          if(g[i] < (max*3-4))
            continue;
     
          if(g[i]%3==0)
            best = g[i]/3;
          else
            best= (g[i]/3) +1;
            
          if(best>=max)
            {
 //             System.out.println("best"+best);
                counter++;  
            }
           else{
               if((max-(g[i]-max)/2) == 2 && sur > 0)
                    {//System.out.println("surprise");
                        counter++;
                        sur--;
                    }
               }
        }

    
        result= "Case #"+m+": "+counter+'\n';
  // System.out.println("Case #"+m+": "+counter);
        buf=result.getBytes();
       try{
           fo.write(buf);
        }
        catch(Exception e){System.out.println("hey");}
        
    
   }
    try{
        fo.close();
        fis.close();
    }
    catch(Exception e){}
}
}
