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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class DancingGooglers {
	
	public static int num (int c,int p,int [] g){
		int n = 0;
		for (int i =0;i<g.length;i++){
			if (g[i]>=p+p+p-2){
				n++;
			}
			else if (g[i]>=p+p+p-4){
				if (c>0){
					n++;
					c--;
				}
			}
		}
		return n;
	}
	
	public static void main (String [] args) throws NumberFormatException, IOException{
		BufferedReader br = new BufferedReader(new FileReader("B-large.in"));
		int t = Integer.parseInt(br.readLine());
		for (int i =0;i<t;i++){
			StringTokenizer s1 = new StringTokenizer(br.readLine());
			int [] g = new int [Integer.parseInt(s1.nextToken())];
			int c = Integer.parseInt(s1.nextToken());
			int p = Integer.parseInt(s1.nextToken());
			for (int j =0;j<g.length;j++){
				g[j] = Integer.parseInt(s1.nextToken());
			}
			if (p>1){
				System.out.printf("Case #%d: %d\n",i+1,num(c,p,g));
			}
			else {
				int n = 0;
				for (int j =0;j<g.length;j++){
					if (g[j]>=p+p+p-2){
						n++;
					}
				}
				System.out.printf("Case #%d: %d\n",i+1,n);
			}
		}
	}
}
