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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class B {

	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("B-small.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("B-small.out"));
		
		
		int T = new Integer(br.readLine());
		for(int cases =0;cases< T; cases ++)
		{
			String str = br.readLine();
			StringTokenizer st = new StringTokenizer(str);
			int N = new Integer(st.nextToken());
			int S = new Integer(st.nextToken());
			int p =new Integer(st.nextToken());
			
			int count =0;
	
			int[] scores = new int[N];
			for(int i =0;i<N;i++)
				scores[i] = new Integer(st.nextToken());
			for(int j=0;j<N;j++)
			{
				int score = scores[j];
				int l = score - 3*p;
				if(l>=0)
				{
					count++;
				}
				else if(l==-1 || l==-2)
				{
					count++;
				}
				else if((l==-3 || l==-4) && S>0 && score >=3*p-4 && score>p)
				{
					count++;
					S--;
				}
				
			}
			pw.println("Case #" +(cases+1) +": " +count);
		}
		
		pw.close();
		br.close();
		

	}

}
