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.FileReader;
import java.io.BufferedReader;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class DancingGooglers {

		/**
		 * @param args
		 */
		public static void main(String[] args) {
			try{
				//read file
				FileReader filein = new FileReader(args[0]);
				BufferedReader in = new BufferedReader(filein);
				//write file 
				FileWriter fileout = new FileWriter("output.txt");
				BufferedWriter out = new BufferedWriter(fileout);
				//process data
				int numcases = Integer.valueOf(in.readLine()).intValue();
				for(int i=0; i<numcases; i++){
					String[] casedata = in.readLine().split(" ");
					int numgooglers = Integer.valueOf(casedata[0]);
					int totalsurprises = Integer.valueOf(casedata[1]);
					int bestresult = Integer.valueOf(casedata[2]);
					int[][] googlers = new int[numgooglers][5];
					int surprises = 0;
					for(int j=0; j<numgooglers; j++){
						googlers[j][0] = Integer.valueOf(casedata[3+j])/3;
						int max = googlers[j][0];
						int min = googlers[j][0];
						googlers[j][1] = (Integer.valueOf(casedata[3+j])-googlers[j][0])/2;
						if(googlers[j][1] > max) max = googlers[j][1];
						if(googlers[j][1] < min) min = googlers[j][1];
						googlers[j][2] = Integer.valueOf(casedata[3+j])-googlers[j][0]-googlers[j][1];
						if(googlers[j][2] > max) max = googlers[j][2];
						if(googlers[j][2] < min) min = googlers[j][2];
						googlers[j][0] = max;
						googlers[j][1] = Integer.valueOf(casedata[3+j]) - max -min;
						googlers[j][2] = min;
						googlers[j][3] = max - min;
						if(max - min > 1) surprises++;
					}
					while(surprises < totalsurprises){
						int test = 0;
						for(int j=0; j<numgooglers; j++){
							if(googlers[j][3] < 2 && googlers[j][0] == bestresult - 1 && googlers[j][1] > 0 ){
								surprises++;
								googlers[j][0]++;
								googlers[j][1]--;
								googlers[j][3] = 2;
								test = 1;
								break;
							}
						}
						if(test == 0) break;
					}
					int result = 0;
					for(int j=0; j<numgooglers; j++){
						if(googlers[j][0] >= bestresult){
							result++;
						}
					}
					out.write("Case #" + (i+1) + ": " + result + "\n");
				}
				//Close the output stream
				out.close();
				//Close the input stream
				in.close();
			}catch (Exception e){//Catch exception if any
				System.err.println("Error: " + e.getMessage());
			}
		}
}
