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.util.StringTokenizer;

public class GoogleDancers{

	public static void main(String[] args) throws Exception{
		FileReader fr = new FileReader("C:\\Projects\\Learning\\src\\B-small-attempt1.in");
		BufferedReader br = new BufferedReader(fr);
		FileWriter fw = new FileWriter("C:\\Projects\\Learning\\src\\BLarge.txt");
		int N = new Integer(br.readLine());
		for (int cases = 1; cases <= N; cases++) {
			String str = br.readLine();
			StringTokenizer st = new StringTokenizer(str); 
			int numberParticipants = Integer.parseInt(st.nextToken());
			int surprise = Integer.parseInt(st.nextToken()); 
			int goodScore = Integer.parseInt(st.nextToken());
			int a[] = new int[numberParticipants];
			for(int i=0; i< numberParticipants; i++) {
				a[i] = Integer.parseInt(st.nextToken());
			}
			int count = 0;
			int possibility = 0;
			int minToGetGoodScore = Math.max(((3 * goodScore) - 2), 1);
			System.out.println("minToGetGoodScore" + minToGetGoodScore);
			int surpriseRange = Math.max(((3* goodScore) - 4), 1);
			if (goodScore > 0 ) {
				for (int i = 0; i < numberParticipants; i++) {
					if (a[i] >= minToGetGoodScore) {
						count++;
						System.out.println("Count" + count);
						

					} else if (a[i] >= surpriseRange
							&& a[i] < minToGetGoodScore) {
						possibility++;
					}
				}System.out.println("Count" + count);
				count = count + Math.min(possibility, surprise);
				System.out.println("Count" + count);
			}
			else
			{
				count = numberParticipants;
			}
			fw.write("Case #" + cases + ": " + count + "\n");
			
		}
		fw.flush();
		fw.close();
	}
}
