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.util.Scanner;


public class QuestionB extends Question{
	
	private int N;
	private int S;
	private int p;
	private int[] dancers;

	public QuestionB(Result result, Counter counter)
	{
		super(result, counter);
	}

	@Override
	public void readInput(Scanner scanner) {
		N = scanner.nextInt();
		S = scanner.nextInt();
		p = scanner.nextInt();
		dancers = new int[N];
		for (int i = 0; i < N; i++) {
			dancers[i] = scanner.nextInt();
		}
	}
	
	@Override
	public String solution() {
		int counter = 0;
		for (int i = 0; i < N; i++) {
			if (dancers[i]>=3*p-Math.min(2,dancers[i]*2))
				counter++;
			else if (dancers[i]>=3*p-Math.min(4,dancers[i]*2) && S>0) {
				S--;
				counter++;
			}
		}
		return Integer.toString(counter);
	}


}
