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 DWG
{
	public static int[] SuspA = null;
	public static int[] nonSuspA = null;

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{

		Scanner scnr = new Scanner(System.in);
		int T = scnr.nextInt();
		for (int t = 1; t <= T; t++)
		{

			int N = scnr.nextInt();
			int S = scnr.nextInt();
			int p = scnr.nextInt();

			SuspA = new int[N];
			nonSuspA = new int[N];

			int ans = 0;
			int suspCount = 0;

			for (int n = 0; n < N; n++)
			{
				int x = scnr.nextInt();
				calcCombs(x, p, n);
				 //System.out.printf ( "a (%d) b (%d) \n" , SuspA[n], nonSuspA[n]);

				if (nonSuspA[n] > 0)
				{
					ans++;
				} else
				{
					if (SuspA[n] > 0 && suspCount < S)
					{
						ans++;
						suspCount++;
					}
				}
			}
			System.out.println("Case #" + t + ": " + ans);
			// System.out.printf("Case #%d: %d\n", t, ans);
		}
	}

	private static void calcCombs(int n, int p, int index)
	{
		int sum = n;
		int minP = p;
		int susp = 0;
		int nonSusp = 0;
		for (int i = 0; i <= 10; i++)
		{
			for (int j = 0; j <= 10; j++)
			{
				for (int k = 0; k <= 10; k++)
				{
					if (i + j + k == sum)
					{
						if (i >= minP || j >= minP || k >= minP)
						{
							if (Math.abs(i - j) > 2 || Math.abs(j - k) > 2  || Math.abs(i - k) > 2 )
							{
								continue;
							}
							if (Math.abs(i - j) == 2 || Math.abs(j - k) == 2  || Math.abs(i - k) == 2 )
							{
								if (i == j && j == k)
								{
									susp = susp + 3;
								} else
								{
									susp++;
								}
								//System.out.printf(" susp (%d)(%d)(%d) \n ", i , j, k);
							} else
							{
								if (i == j && j == k)
								{
									nonSusp = nonSusp + 3;
								} else
								{
									nonSusp++;
								}
								nonSusp++;
								//System.out.printf(" nonsusp (%d)(%d)(%d) \n ", i , j, k);
							}
						}
					}
				}
			}
		}
		 //System.out.printf("susp: %d nonsusp: %d", susp/3, nonSusp/3);
		SuspA[index] = susp / 3;
		nonSuspA[index] = nonSusp / 3;
	}

}
