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;
            }
        }
    }
}
/////     put all imports here    /////////

import java.io.*;
import java.util.*;                // for system.out n stuff
import static java.lang.Math.*;    

///////////////////////////////////////////

public class Dancing {
	public static void main(String[] args) throws FileNotFoundException{
		
		//  handy scanner that everyone uses
		//  nextInt() nextLong() ect. 
	    //  these actually return int and long
		//  happy coding
		Scanner in = new Scanner(System.in);
		
		
		int NumCases = in.nextInt();
		for(int CasesDone=0; CasesDone < NumCases; CasesDone++){
			
			
			
					
			//dont forget to delete the last output from GoogleOut
			System.setOut(new PrintStream(new FileOutputStream("/Users/NathanBreitsch/Desktop/GoogleOut/StoreCreditOut", true)));
			
			
			

			int N = in.nextInt();
			int S = in.nextInt();
			int P = in.nextInt();
			
			int P1 = Math.max(0, P-1);
			int P2 = Math.max(0, P-2);
			
			
			PriorityQueue<Integer> t= new PriorityQueue<Integer>(20, new Comparator<Integer>(){
	            public int compare(Integer o1, Integer o2){
	                return o2 - o1;
	            }
	        });
			
			
			
			for (int i = 0; i < N; i++){
				t.add(in.nextInt());
			}
			
			int sup = 0;
			int max = 0;
			while((sup < S) && (!t.isEmpty())){

				
				
				if (P + 2*(P1) <= t.peek()){
					max++;
				}
				else if(P + 2*(P2) <= t.peek()){
					max ++;
					sup ++;
				}
				
				t.poll();
			}
			
			
			while(! t.isEmpty()){

				
				
				if (P + 2*(P1) <= t.peek()){
					max++;
				}
				
				t.poll();
			}
			
			
			//In Europe, the first floor is numbered zero.
			//But this is America!  Hence the +1
			System.out.print("Case #" + (CasesDone+1) + ": ");
			
			System.out.print(max);
			
			System.out.println();
			
			
		}
	}
}
