import java.util.*;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        B th = new B();
        for (int i = 0; i < T; i++) {
            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();
            int[] t = new int[n];
            for (int j = 0; j < n; j++) {
                t[j] = sc.nextInt();
            }
            int c = th.getAnswer(s,p,t);
            System.out.println("Case #" + (i+1) + ": " + c);
        }
    }
    public int getAnswer(int s, int p, int[] t) {
        int A1 = p + p-1+p-1;
        int A2 = p + p-2+p-2;
        if (A1 < 0)
            A1 = 0;
        if (A2 < 0)
            A2 = 1;
        int remain = s;
        int count = 0;
        int n = t.length;
        for (int i = 0; i < n; i++) {
            if (t[i] >= A1) {
                count++;
            } else if (t[i] < A1 && t[i] >= A2) {
                if (remain > 0) {
                    remain--;
                    count++;
                }
            }
        }
        return count;
    }
}


package com.google.jam.eaque.qualif.b;

import java.io.IOException;

import com.google.jam.eaque.stub.InputFileManager;
import com.google.jam.eaque.stub.Stub;
import com.google.jam.eaque.stub.Util;

public class Small extends Stub {

	@Override
	public String runTestCase(InputFileManager ifm)
			throws NumberFormatException, IOException {
		
		long[] numbers = Util.stringsToLongs(ifm.readAndSplit());
		long[] quotients = new long[(int) numbers[0]];
		long[] remainders = new long[(int) numbers[0]];
		long s = numbers[1];
		long p = numbers[2];
		long res = 0;
		
		for (int i = 0; i < remainders.length; i++) {
			quotients[i] = numbers[i+3] / 3;
			remainders[i] = numbers[i+3] % 3;
			
			if (quotients[i] >= p)
			{
				res++;
			}
			else if (quotients[i] == (p - 1))
			{
				if (remainders[i] != 0)
				{
					res++;
				}
				else if (quotients[i] != 0 && s > 0)
				{
					res++;
					s--;
				}
			}
			else if (quotients[i] == (p - 2) && s > 0)
			{
				if (remainders[i] == 2)
				{
					res++;
					s--;
				}
			}
		}
		
		
		
		return " " + res;
	}
}
