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 gcj.gcj2012.qualif;

import gcj.SolverBase;

import java.io.BufferedReader;
import java.io.PrintStream;

public class ProblemB extends SolverBase {

    public ProblemB() {
        super("Dancing With the Googlers");
    }

    public static void main(String[] args) throws Exception {
        SolverBase problem = new ProblemB();
        // problem.verbose = true;
        problem.solve(System.in, System.out);
    }

    @Override
    public void solveSingle(BufferedReader reader, PrintStream out) throws Exception {
        int[] line = readSingleLineIntArray(reader);
        int N = line[0];
        int S = line [1];
        int p = line [2];

        int x = 0;
        for(int i=3;i<3+N;i++){
            int sum = line [i];

            if( sum < p ){
                // no way...
                continue;
            }

            if( sum >= ((p-1)+(p-1)+p) ){
                // No surprise needed
                x ++;
            }else if( S>0 && sum >= ((p-2)+(p-2)+p) ){
                // Consuming 1 surprise
                x ++;
                S --;
            }
        }

        out.println( x );
    }
}
