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;
   }
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package googlers;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 *
 * @author Calido
 */
public class Googlers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        int t,n,s,p,ti,cnt;
		try
		{
			Scanner scnr=new Scanner(new File(args[0]));
			PrintWriter out=new PrintWriter(new File(args[1]));
			t=scnr.nextInt();
			System.out.println("T: "+t);
			for(int i=1;i<=t;i++)
			{
				cnt=0;
				n=scnr.nextInt();//reading number of googlers
				s=scnr.nextInt();//reading special case
				p=scnr.nextInt();//reading point
				for(int j=0;j<n;j++)
				{
					ti=scnr.nextInt();
					if(ti>=(p+(2*(p-1))))
					{
						cnt++;
					}
					else if(ti>=(p+(2*(p-2))))
					{
						if(ti>=2 && ti<=28)
						{
							if(s>0)
							{
								cnt++;
								s--;
							}
						}
					}
				}
	
				//output to File
				out.println("Case #"+i+": "+cnt);
                                System.out.println("Case #"+i+": "+cnt);
			}
			out.close();
		}
		catch(FileNotFoundException fnfe)
		{
			System.out.println("File Not Found.");
		}

    }
}
