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 cjam;
import java.io.*;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
 *
 * @author Administrator
 */
public class Cjam {

    /**
     * @param args the command line arguments
     */

    public  BufferedWriter output;
    public Scanner input;
    public int T;
    
    
    
     public Cjam()
        {
            
            
               try {
                            input = new Scanner(new FileReader("B-large.in")); 
                           output = new BufferedWriter(new FileWriter(new File("blar.out")));
                     } 
               catch (IOException ex) {
                          Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
                      }
                      
               T = input.nextInt();       
               
        }
    
    
    
    
    
    
    public static void main(String[] args) {
        // TODO code application logic here
       
        Cjam c = new Cjam();
        
        
       for(int i = 1; i <= c.T ; i++)
       {
           int N,S,p,ti[],b1,b2;
           int max1=0,max2=0,max3=0,max=0;
           
           N = c.input.nextInt();
           S = c.input.nextInt();
           p = c.input.nextInt();
           ti = new int[N];
           
           for(int j=0 ; j < N ; j++)
           {
               ti[j] = c.input.nextInt();
           }
           
           if(p > 1)
           {
                   b1 = 3*(p-1) - 1;
                   b2 = 3*(p-1) ;
                   
                   for(int k = 0 ; k < N ; k++ )
                   {
                       if( ti[k] > b2 )
                       {
                           max1++;
                       }
                               
                       else if( (ti[k]==b1) || (ti[k]==b2) )
                       {
                           max2++;
                       }
                       
                   }
                   
                   
                   
              if( max2 > S )
              {
                  max = max1 + S;
              }
              else
              {
                  max = max1 + max2;
              }
           
              
              
           }
           else if(p==1)
           {
               for(int k = 0 ; k < N ; k++ )
                   {
                      if(ti[k] >= 1)
                      {
                          max1++;
                      }
                      
                      max= max1;
                      
                   }
           }
           else if(p==0)
           {
               max = N;
           }
           
           
           
           
           
            try {
                c.output.append("Case #"+i+": "+max);
                
                
                if(i != c.T)  c.output.newLine();
            } catch (IOException ex) {
                Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
            }
           
           
 
       
       
       }
        try {
            c.output.close();
        } catch (IOException ex) {
            Logger.getLogger(Cjam.class.getName()).log(Level.SEVERE, null, ex);
        }
     c.input.close();
       
       
    }
}
