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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class DancingGooglers {
	
	public static int num (int c,int p,int [] g){
		int n = 0;
		for (int i =0;i<g.length;i++){
			if (g[i]>=p+p+p-2){
				n++;
			}
			else if (g[i]>=p+p+p-4){
				if (c>0){
					n++;
					c--;
				}
			}
		}
		return n;
	}
	
	public static void main (String [] args) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new FileReader("B-small-attempt0.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i =0;i<t;i++){
			StringTokenizer s1 = new StringTokenizer(br.readLine());
			int [] g = new int [Integer.parseInt(s1.nextToken())];
			int c = Integer.parseInt(s1.nextToken());
			int p = Integer.parseInt(s1.nextToken());
			for (int j =0;j<g.length;j++){
				g[j] = Integer.parseInt(s1.nextToken());
			}
			if (p>1){
				System.out.printf("Case #%d: %d\n",i+1,num(c,p,g));
			}
			else {
				int n = 0;
				for (int j =0;j<g.length;j++){
					if (g[j]>=p+p+p-2){
						n++;
					}
				}
				System.out.printf("Case #%d: %d\n",i+1,n);
			}
		}
	}
}
