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

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

    public static void main(String[] args) throws IOException {
        PrintStream out = new PrintStream(new File("/output.txt"));
        Scanner in = new Scanner(new File("/B-small-attempt0.in"));
        int testCase = Integer.parseInt(in.next());
        for (int n = 0; n < testCase; n++) {
            int count = 0;
            int googlers = Integer.parseInt(in.next());
            int surprising = Integer.parseInt(in.next());
            int wantScores = Integer.parseInt(in.next());
            for (int g = 0; g < googlers; g++) {
                int scores = Integer.parseInt(in.next());
                if (scores - (wantScores * 3) >= -2) {
                    count++;
                } else if ((surprising > 0) && (((scores - (wantScores * 3) == -4)&&scores>=2) || ((scores - (wantScores * 3) == -3)&&scores>=3))) {
                    surprising--;
                    count++;
                }
            }
            out.println("Case #" + (n + 1) + ": " + count);
            System.out.println("Case #" + (n + 1) + ": " + count);
        }
        in.close();
        out.close();
    }
}
