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.*;


public class DancingWithGooglers {

	private static final Scanner sc = new Scanner(System.in);

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		int T = sc.nextInt();	//number of button presses
		
		for (int i = 0; i < T; i++){
			
			int N = sc.nextInt();	//number of contestants
			int S = sc.nextInt(); 	//number of suprises
			int p = sc.nextInt();	//possible maximum score
						
			int result = 0;
			
			for (int j = 0; j < N; j++){
				
				int t = sc.nextInt();
				
				if (t >= (3 * p - 2))
					result++;
				
				else if (p == 1);
					
				
				else if ((t >= (3 * p - 4)) && (S != 0)){
					result++;
					S--;
				}
				
			}
			
			System.out.println("Case #" + (i + 1) + ": " + result);
			
		}
		
		

	}

}
