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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;


public class dancers {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws IOException
	{
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new FileReader("problem.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i = 1; i <= t; i++)
		{
			String line = br.readLine();
			StringTokenizer st = new StringTokenizer(line, " ");
			int len = Integer.parseInt(st.nextToken());
			int surp = Integer.parseInt(st.nextToken());
			int want = Integer.parseInt(st.nextToken());
			int count = 0;
			int[] vals = new int[len];
			for (int j = 0; j < len; j++)
			{
				vals[j] = Integer.parseInt(st.nextToken());
			}
			for (int k: vals)
			{
				k -= want;
				if (k <0)
					continue;
				else
				{
					if (k >= 2 * want - 2)
					{
						count++;
					}
					else if (k >= 2 * want - 4)
					{
						if (surp == 0)
							continue;
						else
						{
							surp--;
							count++;
						}
					}
				}
			}
			System.out.println("Case #" + i + ": " + count);
			
		}
	}

}
