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

public class Googlers {
	public static void main(String a[]){
		Scanner in = new Scanner(System.in);
		final int T = in.nextInt();
		int[] n = new int[T];
		
		int N, S, P, sum;
		for(int i = 0; i < T; i++){
			N = in.nextInt();
			S = in.nextInt();
			P = in.nextInt();
			
			for(int j = 0; j < N; j++){
				sum = in.nextInt();
				//System.out.println(sum);
				//System.out.println("S " + sum + " P " + P);
				/*
				if(sum <= P){
					n[i]+= 0;
					//System.out.println(sum + "cero");
				}*/
				//else {
					//System.out.println("aasdfas");
					//int resta = sum - P;
					if(sum == 0 &&  P == 0){
						n[i]++;
					}
					else if(sum == 0 && P > 0){
						n[i]+=0;
					}
					else if(sum >= (P + (P-1) + P)){
						//System.out.println("aasdf");
						//System.out.println("1");
						n[i]++;
					}
					else if(sum >= P + P + P){
						n[i]++;
						//System.out.println("2");
					}
					else if(sum >= P + 1 + P + 1 + P + 1){
						n[i]++;
						//System.out.println("3");
					}
					else if(sum >= P + 2 + P + 2 + P + 2){
						n[i]++;
						//System.out.println("4");
					}
					else if(sum >= (P-1) + (P-1) + P){
						n[i]++;
						//System.out.println("5");
					}
					else if(sum >= (P+1) + (P+1) + P){
						n[i]++;
						//System.out.println("6");
					}
					else if(sum >= (P+1) + P + P){
						n[i]++;
						//System.out.println("7");
					}
					else if((sum >= (P+1) + (P-1) + P) && S > 0){
						n[i]++;
						S--;
						//System.out.println("8");
					}
					else if((sum >= (P + (P-1) + (P-2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("9");
					}
					else if((sum >= (P + (P-2) + (P-2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("10");
					}
					else if((sum >= (P + (P+1) + (P-1))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("11");
					}
					else if((sum >= (P + (P+2) + (P+2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("12");
					}
					else if((sum >= (P + (P+2) + P)) && S > 0){
						n[i]++;
						S--;
						//System.out.println("13");
					}
					else if((sum >= (P + (P+1) + (P+2))) && S > 0){
						n[i]++;
						S--;
						//System.out.println("14");
					}
					
					/*
					else if(Math.abs((resta / 2) -  P) == 2){
						if(S > 0){
							S--;
							n[i]++;
							//System.out.println("s");
						}
					}
					else if((resta / 2) - P == 0 || Math.abs(resta / 2 - P) ==1){
						n[i]++;
						//System.out.println("parejo");
					}*/
				}
			}
		//}
		for(int i = 0; i < T; i++){
			System.out.println("Case #" + (i+1) + ": " + n[i]);
		}
	}
}
