/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}



//Author KNIGHT0X300 

import java.util.Scanner;




public class Main {
    
    public static void main(String[] args) {
       Scanner s=new Scanner(System.in);
       int t=s.nextInt();
      
       for(int i=0;i<t;i++)
       {  int tot=0;
           int N=s.nextInt();
           int S=s.nextInt();
           int p=s.nextInt();
   int A=0;     
           for(int j=0;j<N;j++)
           {
               
               A=s.nextInt();
            //  System.out.print(" "+A);
      if(p>=2)
      {    if(S>0)
       {  if((A==(3*p-4))||(A==(3*p-3)))
       {    tot++; S--;              }
       }
       if(A>=3*p-2)
           tot++;
           }
       if(p==0)
       {
       tot++;
       }
       if(p==1)
       {  
       if(A>=1)
       {//System.out.println("sdk");
           tot++;}
       }}
           
           
           
        System.out.println("Case #"+(i+1)+": "+tot);
                      
          
       }
        
    }
}
