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.BufferedWriter;
import java.io.File;
import java.io.IOException;
import java.nio.charset.StandardCharsets;
import java.nio.file.FileSystems;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.StandardOpenOption;
import java.util.Scanner;

public class QB {
	public static int cal(Scanner sc){
		int result = 0;
		
		int N = sc.nextInt();
		int S = sc.nextInt();
		int p = sc.nextInt();
	
		if(p > 1){
			for(int i=0; i<N; i++){
				int t = sc.nextInt();
				if(t >= p*3-2){
					result++;
				} else if(t >= p*3-4 && S > 0){
					S--;
					result++;
				}
			}
		} else if(p == 1){
			for(int i=0; i<N; i++){
				int t = sc.nextInt();
				if(t != 0){
					result++;
				}
			}
		} else if(p == 0){
			for(int i=0; i<N; i++){
				int t = sc.nextInt();
				result++;
			}
		}
		
		return result;
	}
	public static void main ( String [] args ) throws IOException
	{
		Scanner sc = new Scanner(new File("B-small-attempt0.in"));
		Path file = FileSystems.getDefault().getPath(".", "B-small-practice.out");
		BufferedWriter writer = Files.newBufferedWriter(file, StandardCharsets.US_ASCII, StandardOpenOption.CREATE);
		
		int t = sc.nextInt();
		for(int i=0; i<t; i++){
			String output = String.format("Case #%d: %d\n", i+1, cal(sc));
			writer.write(output);
		}
		sc.close();
		
		writer.flush();
		writer.close();
	}
}