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 codejam.round1;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class ProblemB {
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(args[0]));
		PrintStream out = new PrintStream(args[1]);

		int testsCount = Integer.parseInt(reader.readLine());
		for (int test = 1; test <= testsCount; test++) {
			String input = reader.readLine();
			StringTokenizer tokenizer = new StringTokenizer(input);
			int N = Integer.parseInt(tokenizer.nextToken());
			int S = Integer.parseInt(tokenizer.nextToken());
			int p = Integer.parseInt(tokenizer.nextToken());
			List<Integer> nonSurprisingExceedingP = new ArrayList<Integer>();
			List<Integer> suprisingExceedingP = new ArrayList<Integer>();
			for (int i = 0; i < N; i++) {
				int ti = Integer.parseInt(tokenizer.nextToken());
				if (bestNonSuprisingSolution(ti) >= p) {
					nonSurprisingExceedingP.add(i);
				}else if(hasSuprisingSolution(ti) && bestSuprisingSolution(ti) >=p) {
					suprisingExceedingP.add(i);
				}
			}
			int googlersCount = nonSurprisingExceedingP.size() + Math.min(S, suprisingExceedingP.size());
			out.println(String.format("Case #%s: %s", test, googlersCount));
		}

		out.close();
		reader.close();
	}

	private static int nearestUpperMultipleOfThree(int a) {
		if (a == 0 || a % 3 == 0) {
			return a;
		}
		return a + (3 - (a % 3));
	}

	private static int nearestMultipleOfThree(int a) {
		if (a == 0 || a % 3 == 0) {
			return a;
		}
		if (a % 3 == 1) {
			return a - 1;
		}
		return a + 1;
	}

	private static int bestNonSuprisingSolution(int total) {
		return nearestUpperMultipleOfThree(total) / 3;
	}

	private static boolean hasSuprisingSolution(int total) {
		return total > 1;
	}

	private static int bestSuprisingSolution(int total) {
		return (nearestMultipleOfThree(total) / 3) + 1;
	}
}
