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

public class Surprising {
    public static void main(String[] args) {
        
        int T = StdIn.readInt();
        for (int i = 1; i <= T; i++) {
            int N = StdIn.readInt();
            int S = StdIn.readInt();
            int P = StdIn.readInt();
            int count = 0;
            int sCount = 0;
            
            for (int j = 0; j < N; j++) {
                int googler = StdIn.readInt();
                if (googler > (3*P - 3))
                    count++;
                else if ((googler > (3*P - 5)) && sCount < S) {
                    if (googler != 0 && P != 1) {
                        count++;
                        sCount++;
                    }
                }               
            }
            StdOut.println("Case #" + i + ": " + count); 
        }        
    }
}
