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.File;
import java.util.Arrays;
import java.util.Scanner;


public class ProblemB {

	public static void main(String[] args) throws Exception {
		
		Scanner leitor = new Scanner(new File("problemBTest.in"));
		int n = leitor.nextInt(); leitor.nextLine();
		for (int i = 0; i < n; i++) {
			int dancers = leitor.nextInt();
			int surp = leitor.nextInt();
			int min = leitor.nextInt();
			int notas[] = new int[dancers];
			for (int j = 0; j < dancers; j++) {
				notas[j] = leitor.nextInt();
			}
			leitor.nextLine();
			Arrays.sort(notas);
			
			int resultado = 0;
			
			int j = 0;
			for (j = dancers-1; j >=0; j--) {
				if (notas[j] > (3 * (min-1))) {
					resultado++;
				} else {
					break;
				}
			}
			
			while (surp > 0 && j >= 0) {
				if ((min-2) >= 0) { 
					if (((notas[j] - min - (min-2)) >= (min-2)) &&
						((notas[j] - min - (min-2)) < (min+2))	) {
						resultado++;
						surp--;
					}
				}
				j--;
			}
			System.out.println("Case #" + (i+1) + ": " + resultado);
		}
	}

}
