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 Test2
{
	public static void main(String[] args)
	{
		Scanner keyboard = new Scanner(System.in);
		int num = Integer.parseInt(keyboard.nextLine());
		String[] input = new String[num];
		String tmp = "";

		int N = 0;
		int S = 0;
		int P = 0;

		int[] out = new int[num];

		for (int i = 0; i < num; i++)
		{
			input[i] = keyboard.nextLine();
			String[] split = input[i].split(" ");
			N = Integer.parseInt(split[0]); // numbers
			S = Integer.parseInt(split[1]); // surprise
			P = Integer.parseInt(split[2]); // at least
			int[] nums = new int[N];
			for (int j = 0; j < N; j++)
			{
				nums[j] = Integer.parseInt(split[j + 3]);
			}
			int count = 0;
			for (int j = 0; j < N; j++)
			{
				if (P == 0)
				{
					count++;
				}
				else if (nums[j] >= (P * 3 - 2))
				{
					count++;
				}
				else if(nums[j] > 0)
				{
					if (P == 1 && nums[j] >= 3)
					{
						count++;
					}
					else if ((nums[j] - P) >= ((P - 2) * 2))
					{
						if (S > 0)
						{
							S--;
							count++;
						}
					}
				}
			}
			out[i] = count;
		}
		// for(int j=0;j<N;j++)
		// System.out.print(nums[j]+ " ");
		// System.out.println();
		for (int i = 0; i < out.length; i++)
		{
			System.out.println("Case #" + (i + 1) + ": " + out[i]);
		}
	}
}
