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.*;
public class B {

	/**
	 * @param args
	 */
	private static boolean sup(int i,int j,int k) {
		return (Math.abs(i-j)==2 || Math.abs(i-k)==2 || Math.abs(j-k)==2);
	}
	
	private static boolean[] analyze(int x, int p) {
		int i,j,k;
		boolean ret[] = new boolean[4];
		for (i=0;i<=10;i++) {
			for (j=0;j<=10;j++) {
				if (Math.abs(i-j)<=2) {
					k = x-i-j;
					if (k>=0 && k<=10 && Math.abs(k-i)<=2 && Math.abs(k-j)<=2) {
						if (i>=p || j>=p || k>=p) {
							if (sup(i,j,k)) {
								ret[0] = true;
							} else {
								ret[1] = true;
							}
						} else if (sup(i,j,k)) {
							ret[2] = true;
						} else {
							ret[3] = true;
						}
					}
				}
			}
		}
		return ret;
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int i,j;
		for (i=1;i<=T;i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int overp = 0;			
			int condp = 0;
			int result;
			for (j=0;j<N;j++) {
				int x = in.nextInt();
				if (x>(p-1)*3) {
					overp++;					
				} else if (x<3*p-4 || p==1) {					
				} else {
					condp++; 
				}
			}
			result = Math.min(S, condp) + overp;
			System.out.println("Case #"+i+": "+result);
		}
	}

}
