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.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Arrays;
import java.util.StringTokenizer;

public class B {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		int n; // # googlers
		int s; // surprising
		int p; // score
		int scores[];
		int max;
		int min;
		int ret;

		BufferedReader br = new BufferedReader(new FileReader("b.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("b.out"));
		StringTokenizer tk;

		int tests = Integer.parseInt(br.readLine().trim());

		for (int t = 1; t <= tests; t++) {
			tk = new StringTokenizer(br.readLine());
			n = Integer.parseInt(tk.nextToken());
			s = Integer.parseInt(tk.nextToken());
			p = Integer.parseInt(tk.nextToken());

			max = 3 * p - 2;
			min = 3 * p - 4;

			ret = 0;
			scores = new int[n];
			for (int j = 0; j < scores.length; j++)
				scores[j] = Integer.parseInt(tk.nextToken());

			Arrays.sort(scores);

			if (p >= 2)
				for (int i = scores.length - 1; i >= 0; i--) {
					if (scores[i] >= max)
						ret++;
					else if (scores[i] < min)
						break;
					else {
						
						if (s==0)break;
						ret++;
						s--;
					}
				}

			else {
				if (p == 0)
					ret += scores.length;
				else
					for (int i = scores.length-1; i>=0; i--) {
						if (scores[i] > 0)
							ret++;
						else
							break;
					}

			}

//			System.out.println("Case #" + t + ": " + ret);
			bw.write("Case #" + t + ": " + ret);
			bw.newLine();

		}

		bw.close();
	}

}
