package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}

import java.io.*;
import java.util.StringTokenizer;

public class Solution {
	public static void main(String args[]){
		try{
		FileInputStream fin=new FileInputStream("C:\\Program lang\\Google Code Jam\\input00.txt");
		DataInputStream datain=new DataInputStream(fin);
		BufferedReader br=new BufferedReader(new InputStreamReader(datain));
		int T=Integer.parseInt(br.readLine());
		for(int j=0;j<T;j++){
		StringTokenizer st=new StringTokenizer(br.readLine());
		int N=Integer.parseInt(st.nextToken());// googlers
		int S=Integer.parseInt(st.nextToken());// surprising triplets
		int p=Integer.parseInt(st.nextToken());// least max of triplet
		int out=0;
		for(int i=0;i<N;i++){
			int num=Integer.parseInt(st.nextToken());
			if(num%3==0){
				if(num/3>=p){
					out++;
				}
				else if((num+3)/3==p && S>0 && num>=3)	{
					S--;
					out++;
				}
				
			}
			else if(num%3==1){
				if((num+2)/3>=p)	out++;
			}
			else{
				if((num+1)/3>=p && num>=2)	out++;
				else if((num+4)/3>=p && S>0 && num>=2) {
					out++;
					S--;
				}
			}
		}
		System.out.println("Case #"+(j+1)+": "+out);
		
		}
		
		}catch(Exception e){
			System.out.println(e);
		}
	}
	
}