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;
    }
}


import java.io.*;
import java.util.ArrayList;
import java.util.Scanner;

public class QualificationRoundB {
    public static void main(String[] args) throws IOException {
        String inFile = args[0];
        String outFile = inFile.replaceAll("\\.in$", ".out");

        Scanner scanner = new Scanner(new FileInputStream(inFile));
        int cases = scanner.nextInt();

        FileWriter fileWriter = new FileWriter(outFile);
        BufferedWriter bufferedWriter = new BufferedWriter(fileWriter);
        for(int c = 1; c <= cases; c++){
            bufferedWriter.write(String.format("Case #%d: ", c));
            int N = scanner.nextInt();
            int S = scanner.nextInt();
            int p = scanner.nextInt();
            int t[] = new int[N];
            for(int n = 0; n < N; n++)
                t[n] = scanner.nextInt();

            int count = 0;
            int midTop = 3*p - 3;
            int midBot = 3*p - 4;
            for(int n = 0; n < N; n++){
                switch(p){
                    case 0:
                    case 1:
                        if(t[n] >= p)
                            count++;
                        break;
                    default:
                        if(t[n] > midTop){
                            count++;
                        }
                        else if(t[n] >= midBot && S > 0){
                            S--;
                            count++;
                        }
                }
            }
            System.out.println(String.format("%d", count));
            bufferedWriter.write(String.format("%d\n", count));
        }
        bufferedWriter.close();
        fileWriter.close();
    }
}
