/*
 * 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);
        }


    }
}


/**
 * Write a description of class solver here.
 * 
 * @author (your name) 
 * @version (a version number or a date)
 */
public class solver
{
   public int solve(int nog,int nos,int p,int t[])
   {
       int[] aux=new int[2*nog];
       int i=0,count=0;
       for(i=0;i<nog;i++)
       {   
               if(t[i]==0)
               {
                 aux[i]=0;
                 aux[nog+i]=-1;
                }
               else if(t[i]==1)
               {
                 aux[i]=1;
                 aux[nog+i]=-1;
                }
                
               else if(t[i]==29)
               {
                 aux[i]=10;
                 aux[nog+i]=-10;
                }
               else if(t[i]==30)
               {
                 aux[i]=10;
                 aux[nog+i]=-10;
                }
                else if(t[i]%3==0)
                {
                    aux[i]=t[i]/3;
                    aux[nog+i]=t[i]/3+1;
                }
                else if(t[i]%3==1)
                {
                    aux[i]=t[i]/3+1;
                    aux[nog+i]=-1;
                }
                else
                {
                    aux[i]=t[i]/3+1;
                    aux[nog+i]=t[i]/3+2;
                }
                
       }
       for(i=0;i<nog;i++)
       {
           if(aux[i]>=p)
           {
               count++;
               aux[nog+i]=-1;
            }
        }
        for(i=0;i<nog;i++)
        {
            if(nos==0)
            break;
            else if(aux[i+nog]>=p)
            {
                   nos-=1;
                   count++;
            }
        }
        return count;
       
    }
}