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.*;
import java.io.*;
import java.lang.*;

public class RQQ2 {
	
	public static void main(String[] args)
	{
		try
		{
			HashMap<Character,Character> map = new HashMap<Character,Character>();
			Scanner s = new Scanner(new File("B-small-attempt0.in"));
			FileWriter o = new FileWriter(new File("out.txt"));
			
			Integer lines = Integer.parseInt(s.nextLine());
			String str;
			Integer sup;
			Integer googlers;
			Integer p;
			StringTokenizer st;
			
			for (int i = 0; i < lines; i++)
			{
				o.write("Case #" + ( i + 1) + ": ");
				str = s.nextLine();
				st = new StringTokenizer(str, " ");
				googlers = Integer.parseInt(st.nextToken());
				sup = Integer.parseInt(st.nextToken());
				p = Integer.parseInt(st.nextToken());
				int even = 0;
				int max = 0;
				
				for (int j = 0; j < googlers; j++)
				{
					int total = Integer.parseInt(st.nextToken());
					if ( Math.ceil((double)total / 3.0) >= p )
					{
						max++;
					}
					else if ( total != 0 && Math.ceil((double)total/3.0 + 2.0/3.0) >= p)
					{
						even++;
					}
				}
				max += Math.min(even, sup);
				o.write("" + max + "\n");
			}
			
			s.close();
			o.close();
			
		}
		catch(Exception e)
		{
			System.out.println(e.getMessage());
			e.printStackTrace(System.out);
		}
	}
}
