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 Dance {
	JamInputReader ir;
	
	public Dance(String fileName) {
		ir = new JamInputReader(fileName);
		int t = ir.getNumItems();
		
		for(int i = 0; i < t; i++) {
			int n = ir.getNextInt();
			int s = ir.getNextInt();
			int p = ir.getNextInt();
			
			int c = 0;
			int l = p * 3 - 4;
			
			for(int j = 0; j < n; j++) {
				int q = ir.getNextInt();
				
				if(p < 2) {
					if(q >= p)
						c++;
				} else {
					if(q > l + 1)
						c++;
					else if(s > 0 && (q == l || q == l + 1)) {
						s--;
						c++;
					}
				}
			}
			
			System.out.println("Case #" + (i + 1) + ": " + c);
		}
	}
	
	public static void main(String[] args) {
		new Dance(args[0]);
	}
}
