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 _2011.qualification;

import java.util.Scanner;

public class DancingWithTheGooglers {
	
	public static void main(String[] args) {
		Scanner consola = new Scanner(System.in);
		int nGooglers, nSurprise, top, total, cont, times = consola.nextInt();
		for(int t = 1; t <= times; t++){
			nGooglers = consola.nextInt();
			nSurprise = consola.nextInt();
			top = consola.nextInt();
			cont = 0;
			for(int i = 0; i < nGooglers; i++){
				total = consola.nextInt();
				if(total < top)
					continue;
				if(total >= (top * 3) - 2)
					cont++;
				else if(nSurprise > 0 && total >= (top * 3) - 4){
					cont++;
					nSurprise--;
				}
			}
			System.out.println("Case #" + t + ": " + cont);
		}
	}
}