import java.util.*;
import java.io.*;

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;

public class qualb{
	
	public static void main(String[] args){
		qualb.solve();
	}
	
	private static void solve(){
		String fileName = "B-large.in";
		String outputFileName = fileName;
		if(outputFileName.contains(".")){
			outputFileName = outputFileName.substring(0,outputFileName.indexOf("."));
		}
		outputFileName = outputFileName+".out";
        File file = new File(fileName); 

        try { 
        	FileWriter fstream = new FileWriter(outputFileName,true);
    		 BufferedWriter out = new BufferedWriter(fstream);
        	BufferedReader reader = new BufferedReader(new FileReader(file));       
        	
        	//Number of cases
        	String text = reader.readLine();
        	int NoCases = Integer.parseInt(text);
        	
        	for(int caseNo=0;caseNo<NoCases;caseNo++){
        		//Case line
        		text = reader.readLine();
        		String[] caseLine = text.split(" ");
        		
        		//No of googlers
        		int NoGooglers = Integer.parseInt(caseLine[0]);
        		
        		//No of supprising scores
        		int NoSupprising = Integer.parseInt(caseLine[1]);
        		
        		//Score in question
        		int p = Integer.parseInt(caseLine[2]);
        		
        		int minScoreUnSupprising = p*3-2;
        		if(minScoreUnSupprising<=0) minScoreUnSupprising = p;
        		int minScoreSupprising = p*3-4;
        		if(minScoreSupprising<=0) minScoreSupprising = p;
        		
        		int NoGooglersUnSupprising = 0;
        		int NoGooglersSupprising = 0;
        		
        		for(int Googler=0;Googler<NoGooglers;Googler++){
        			int GooglerScore = Integer.parseInt(caseLine[3+Googler]);
        			if(GooglerScore>=minScoreUnSupprising){
        				NoGooglersUnSupprising++;
        			} else if(GooglerScore>=minScoreSupprising){
        				NoGooglersSupprising++;
        			}
        		}
        		
        		if(NoGooglersSupprising>NoSupprising) NoGooglersSupprising = NoSupprising;
        		System.out.println("Case #"+(caseNo+1)+": "+(NoGooglersUnSupprising+NoGooglersSupprising));
        		out.write("Case #"+(caseNo+1)+": "+(NoGooglersUnSupprising+NoGooglersSupprising));
        		out.newLine();
        	}
        	out.close();
        } catch (Exception e) { 
            System.out.println(e); 
        }
	}
}