package util.graph;

import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.Set;

public class DynDjikstra {
    public static State FindShortest(Node start, Node target) {
        PriorityQueue<Node> openSet = new PriorityQueue<>();
        Set<Node> closedSet = new HashSet<>();
        openSet.add(start);
        while (!openSet.isEmpty()) {
            Node current = openSet.poll();
            for (Edge edge : current.edges) {
                Node end = edge.target;
                if (closedSet.contains(end)) {
                    continue;
                }
                State newState = edge.travel(current.last);
                //if (end.equals(target)) {
                    //return newState;
                //}
                if (openSet.contains(end)) {
                    if (end.last.compareTo(newState)>0) {
                        end.last = newState;
                    }
                } else {
                    openSet.add(end);
                    end.last = newState;
                }
            }
            closedSet.add(current);
            if (closedSet.contains(target)) {
                return target.last;
            }
        }

        return target.last;
    }
}

import java.util.Scanner;

public class problemB {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner cin = new Scanner(System.in);
		int t = cin.nextInt();
		int k = 0, n, s, p, i, ans;
		int[] a;
		while (t > 0) {
			t--;
			k++;
			n = cin.nextInt();
			s = cin.nextInt();
			p = cin.nextInt();
			a = new int[n];
			for (i = 0; i < n; i++)
				a[i] = cin.nextInt();
			ans = 0;
			for (i = 0; i < n; i++) {				
				if(a[i]>=p+Math.max(p-1, 0)*2){
					ans++;
				}else
					if(a[i]>=p+Math.max(p-2, 0)*2 && s>0){
						ans++;
						s--;
					}
			}
			System.out.println("Case #"+k+": "+ans);
		}
	}

}
