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.*;
import java.math.*;
/** @author Samuel Ahn */

public class B {
    public static void main(String args[]) throws Exception {
	Scanner in = new Scanner(System.in);
	int T = in.nextInt();
	for (int i = 1; i <= T; i++) {
	    int N = in.nextInt();
	    int S = in.nextInt();
	    int p = in.nextInt();
	    int[] array = new int[N];
	    for (int j = 0; j < N; j++) {
		array[j] = in.nextInt();
	    }
	    Arrays.sort(array);
	    int sum = 0;
	    for (int j = 0; j < N; j++) {
		int temp = array[j];
		if ((temp == 0)) {
		    if (temp >= p) {
			sum++;
		    }
		} else if ((temp == 1)) {
		    if (temp >= p) {
			sum++;
		    }
		} else {
		    if (S > 0) {
			if (((temp + 4) / 3) >= p) {
			    sum++;
			    S--;
			}
		    } else {
			if (((temp + 2) / 3) >= p) {
			    sum++;
			}
		    }
		}
	    }
	    System.out.printf("Case #%d: %d\n", i, sum);
	}
    }
}