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 atm;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.*;
/**
 *
 * @author Antonio Lievano
 */
public class Googlers {
    public static void main (String[]Args) throws FileNotFoundException {
    FileReader reader = new FileReader("C:\\Users\\Antonio Lievano\\Desktop\\B-large.in");
    Scanner in = new Scanner(reader);
    int cases = Integer.parseInt(in.nextLine());
    for (int i = 0; i<cases; i++) {
    System.out.print("Case #" + (i+1) + ": ");
    String line = in.nextLine();
    String [] temp = line.split(" ");
    int n = Integer.parseInt(temp[0]);
    int s = Integer.parseInt(temp[1]);
    int p = Integer.parseInt(temp[2]);
    int answer = 0;
    int counter = 0;
    int [] points = new int [temp.length-3];
    for (int x = 0; x<temp.length-3; x++){
        points[x] = Integer.parseInt(temp[x+3]);
    }
    for (int j = 0; j<points.length; j++) {
        if (points[j]>((p*3)-3)) {
            points[j] = -9999999;
            answer++;
        }
    }
        for (int k = 0; k<points.length; k++){
            if (counter==s)
                break;
            if (((p*3)-5)<0)
                break;
            if (points[k]>((p*3)-5)){
                points[k] = -9999999;
                answer++;
                counter++;
            }
    }
    System.out.print(answer);
    System.out.println();
    }
}
}