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.File;
import java.io.FileReader;
import java.io.IOException;

public class GoogleDancing {
	public static void solution(String fileName) throws IOException {

		FileReader fileReader = new FileReader(new File(fileName));
		BufferedReader bufferedReader = new BufferedReader(fileReader);

		String textLine = bufferedReader.readLine();

		int lines = Integer.parseInt(textLine);
		int[] ret = new int[lines];
		for (int i = 0; i < lines; i++) {
			textLine = bufferedReader.readLine();
			String[] t = textLine.split(" ");
			int N = Integer.parseInt(t[0]);
			int S = Integer.parseInt(t[1]);
			int p = Integer.parseInt(t[2]);
			int c = 0;
			int c1 = 0;
			int min = p * 3 - 2;
			min = min > 0 ? min : 0;
			int min1 = min - 2;
			min1 = min1 > 0 ? min1 : 0;
			for (int j = 3; j < t.length; j++) {
				int tt = Integer.parseInt(t[j]);
				if (tt == 0) {
					if (p == 0) {
						c++;
					}
					continue;
				}
				if (tt < p)
					continue;
				if (tt >= min) {
					c++;
				} else if (tt >= min1 && c1 < S) {
					c++;
					c1++;
				}
			}
			ret[i] = c;
		}
		for (int i = 0; i < ret.length; i++) {
			System.out.println("Case #" + (i + 1) + ": " + ret[i]);
		}

	}

	public static void main(String[] args) throws Exception {
		solution("c:\\sql\\B-large.in");
	}
}
