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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.LinkedList;
import java.util.StringTokenizer;


public class Principal 
{
	public static void main(String [] args) throws IOException
	{
		
		FileReader fr = new FileReader("B-small-attempt0.in");
		BufferedReader bf = new BufferedReader(fr);
		
		FileWriter bw = new FileWriter("B-small-attempt0.out");
		
		int res;
		int times = Integer.parseInt(bf.readLine());
		
		LinkedList<Integer> l = new LinkedList<Integer>();
		String str = bf.readLine();
		int i = 1;
		StringTokenizer st;
		while(i <= times)
		{
			st = new StringTokenizer(str);	
			while(st.hasMoreTokens())
			{
				l.add(Integer.parseInt(st.nextToken()) );
			}
			bw.write("Case #");
			bw.write(String.valueOf(i));
			bw.write(": ");
			l.pop();
			int s = l.pop();
			int p = l.pop();
			res = Triplet.triplete(l, p, s);
			bw.write(Integer.toString(res));
			bw.write("\n");
			str = bf.readLine();
			i++;
			l = new LinkedList<Integer>();
		}
		bw.close();
		bf.close();
	}
}
