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 com.google.codejam;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Dancing {	
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream("B-large.in")));
		PrintWriter writer = new PrintWriter("output.txt");
		int n = Integer.parseInt(reader.readLine());
		for(int i = 1; i <= n; i++) {
			writer.print("Case #" + i + ": " + solve(reader.readLine()));
			writer.println();
		}
		reader.close();
		writer.close();
	}
	
	private static int solve(String line) {
		String[] datas = line.split(" ");
		int n = Integer.parseInt(datas[0]);
		int s = Integer.parseInt(datas[1]);
		int p = Integer.parseInt(datas[2]);
		int count = 0;		
		for (int i = 3; i < n + 3; ++i) {
			int t = Integer.parseInt(datas[i]);
			if (t >= p * 3) {
				++count;
				continue;
			}
			if (t < p) {
				continue;
			}
			int diff = (t - p) / 2;
			if (p - diff <= 1) {
				++count;
				continue;
			}
			if (p - diff == 2 && s > 0) {
				--s;
				++count;
			}
		}
		return count;
	}

}
