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

import java.io.*;
import java.util.Scanner;

class Solver {
	public void createSolution(Scanner input, BufferedWriter outWriter) throws IOException {
		int numCases = input.nextInt();
		for (int i = 0; i < numCases; i++) {
			int solution = 0;
			int possibilities = 0;

			int numDancers = input.nextInt();
			int surprises = input.nextInt();
			int p = input.nextInt();
			
			for (int k = 0; k < numDancers; k++) {
				int score = input.nextInt();
				if (p == 0 || score > Math.max(0, (3*p - 3))) {
					solution++;
				} else if (score > Math.max(0, (3*p - 5))) {
					possibilities++;
				} else {
					// ignore because score < 3*p - 4
				}
			}

			if (surprises < possibilities) {
				solution = solution + surprises;
			} else {
				solution = solution + possibilities;
			}

			outWriter.write("Case #" + String.valueOf(i + 1) + ": " + solution + "\n");
		}
		outWriter.close();
	}
}
