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


    }
}


import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

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

/**
 *
 * @author sony
 */

public class DancingGooglers {
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
     BufferedReader br=new BufferedReader(new FileReader(args[0]));
  
  int Testcases=Integer.parseInt(br.readLine());
    for(int i=0;i<Testcases;i++)
    {
    String[] line=br.readLine().split(" ");
    int N=Integer.parseInt(line[0]);
    int S=Integer.parseInt(line[1]);
    int p=Integer.parseInt(line[2]);
    int count=0;
    //System.out.print("N="+N+"S="+S+"p="+p+"\n");
    int indicator=0;
    for(int j=0;j<N;j++)
    {
    int reminder=Integer.parseInt(line[3+j])%3;
    int quotient=Integer.parseInt(line[3+j])/3;
    int sum=Integer.parseInt(line[3+j]);
    
    if(reminder==0)
    indicator++;
    
    if((quotient>=p)||(reminder==1&&quotient+1==p)||(reminder==2&&quotient+1==p))
        count++;
    else if(S>0&&sum>=p){
    
    if((reminder==0&&quotient+1==p)||(reminder==2&&quotient+2==p))    
    {
        S--;
        count++;
    }
        
    }
    
    
    }
    
    System.out.print("Case #"+(i+1)+": "+count+"\n");
    
    
    
    }
    
    }
    
}

