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.util.*;
import java.io.*;

public class DancingGooglers {

	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int count = in.nextInt(); 
		//in.nextLine();
		for(int i=0;i<count;i++){
			int N=in.nextInt();
			int s=in.nextInt();
			int p=in.nextInt();
			int scores[]=new int[N];
			for(int j=0;j<N;j++){
				scores[j]=in.nextInt();
			}
			int max=processOneCase(N,s,p,scores);
			System.out.println("Case #"+(i+1)+": "+max);
		}
		
		
	}
	public static int processOneCase(int N,int s,int p,int[] scores){
		int max=0;
		for(int i=0;i<N;i++){
			int score=scores[i];
			double avg=(double)score/3.0;			
			if(avg>p-1){
				//System.out.println("case 1");
				max++;
			}
			else if(score/3 == p-1 && s!=0){
				if(!(score==0 && p==1))
				{					
				s--;
				max++;
				//System.out.println("case 2");
				}
			}
			else if(avg>p-2 && avg <p-1 && s!=0){
				if(score-3*(score/3) == 2)
				{
					s--;
					max++;
					//System.out.println("case 3");
				}
			}
		}
		
		return max;
	}
	
}
