import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

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

public class PracticeB
{
	/* ±±©çÒW */
	private static final String fname = "B-small-attempt0.in"; // üÍpÌt@C¼
	public static void solve()
	{
		int T = sc.nextInt();
		for (int i = 1; i <= T; i++)
		{
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			
			int tp[] = new int[N];
			int cnt = 0;
			
			for (int j = 0; j < N; j++)tp[j] = sc.nextInt();
			Arrays.sort(tp);
			int[][] ti = new int[N][3];
			for (int j = ti.length - 1; j >= 0; j--)
			{
				int tv = tp[j] / 3;
				double val = tp[j] / 3.0;
				if(val - tv < 0.5)
				{
					ti[j][0] = tv;
					ti[j][1] = tv;
					ti[j][2] = tv + 1;
				}if(val - tv > 0.5)
				{
					ti[j][0] = tv;
					ti[j][1] = tv + 1;
					ti[j][2] = tv + 1;
				}if(val - tv == 0)
				{
					ti[j][0] = tv;
					ti[j][1] = tv;
					ti[j][2] = tv;
				}
//				for (int k = 0; k < 3; k++) System.out.print(ti[j][k] + " ");
//				System.out.println();
				if(ti[j][2] >= p)
				{
					cnt++;
					continue;
				}
				if(val - tv < 0.5)
				{
					ti[j][0] = tv - 1;
					ti[j][1] = tv + 1;
					ti[j][2] = tv + 1;
					if(ti[j][2] > 10 || ti[j][0] < 0)
					{
						ti[j][0]++;
						ti[j][2]--;
					}
				}if(val - tv > 0.5)
				{
					ti[j][0] = tv;
					ti[j][1] = tv;
					ti[j][2] = tv + 2;
					while(ti[j][2] > 10 || ti[j][0] < 0)
					{
						ti[j][0] = tv++;
						ti[j][2] = tv--;
					}
				}if(val - tv == 0)
				{
					ti[j][0] = tv - 1;
					ti[j][1] = tv;
					ti[j][2] = tv + 1;
					if(ti[j][2] > 10 || ti[j][0] < 0)
					{
						ti[j][0]++;
						ti[j][2]--;
					}
				}
				if(S > 0 && ti[j][2] >= p)
				{
					cnt++;
					S--;
				}
			}
//			System.
			out.println("Case #" + i + ": " + cnt);
		}
	}
	/* ±±ÜÅ */

	private static Scanner sc;
	private static PrintWriter out;
	public static void main(String args[])
	{
		try
		{
			sc = new Scanner(new File(fname));
//			sc = new Scanner(System.in);
			out = new PrintWriter(new BufferedWriter(new FileWriter(new File(fname + "_out.dat"))));
		} catch (Exception e)
		{
			e.printStackTrace();
		}
		solve();
		out.close();
	}

}
