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 DancingWiththeGooglers {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int T = Integer.parseInt(sc.nextLine());
		int r[] = new int[T];
		
		for (int i = 0; i < T; i++) {		
			int N = sc.nextInt();
			int S = sc.nextInt();
			int p = sc.nextInt();
			for (int j = 0; j < N; j++) {
				int total = sc.nextInt();
				if (total >= p) {
					if ((p*3 - 2) <= total) {
						r[i]++;
					} else if ((p*3 - 4) <= total && S > 0) {
						S--;
						r[i]++;
					}
				}
			}
		}
		
		for (int i = 0; i < r.length; i++) {
			System.out.println("Case #" + (i + 1) + ": " + r[i]);
		}
	}
}