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


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package uk.co.epii.codejam.dancingwiththegooglers;

/**
 *
 * @author jim
 */
public class DataRow {
    
    public final int N;
    public final int S;
    public final int p;
    public final int[] t;
    
    public DataRow(String in) {
        String[] parts = in.split(" ");
        N = Integer.parseInt(parts[0]);
        S = Integer.parseInt(parts[1]);
        p = Integer.parseInt(parts[2]);
        t = new int[N];
        for (int i = 3; i < N + 3; i++) 
            t[i - 3] = Integer.parseInt(parts[i]); 
    }
    
}
