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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


/**
 * @author Paul LaMotte
 *
 */
public class GooglerDance {

	public static void main(String[] args) {
		
		Scanner in;
		try {
			System.setOut(new PrintStream(new File("qualB.out")));
			in = new Scanner(new File("B-small-attempt2.in"));
			int lines = Integer.parseInt(in.nextLine());
			for (int i = 0; i < lines; i++) {
				int googlers = in.nextInt();
				int trips = in.nextInt();
				int best = in.nextInt();
				int count = 0;
				ArrayList<Integer> scores = new ArrayList<Integer>();
				for (int j = 0; j < googlers; j++) {
					int score = in.nextInt();
					int rem = score - best;
					int tmp = (int)Math.floor(rem / 2);
					if (score < best) {
						continue;
					}
					if (best - tmp <= 1) {
						count++;
					} else if (best - tmp <= 2 && trips > 0) {
						trips -= 1;
						count++;
					}
				}
				
				System.out.printf("Case #%d: %d\n", i + 1, count);
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}	}
}
