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;
    }
}

package problems;

import java.util.Scanner;


public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t= sc.nextInt(), N, S, P, Rnumber, number, aux;
		for (int i=1; i<=t; i++){
			N= sc.nextInt();
			S= sc.nextInt();		
			P= sc.nextInt();
			aux=0;
			P=3*P-2;
			Rnumber= P-2;
			if (P==1) Rnumber =1;
			System.out.print("Case #"+i+": ");
			for (int j=0; j<N; j++){
				number=sc.nextInt();
				if (number>=P){
					aux++;
				}
				else if ((S>0) && (number>=Rnumber)){
					S--;
					aux++;
				}
			}
			System.out.println(aux);
		}
	}
}