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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintStream;


public class Solver {
	
	protected final static String IN_FILE = "in";
	protected final static String OUT_FILE = "out";
	protected final static String OUT_PREFIX = "Case #$: ";
	protected BufferedReader in;
	protected int cases;
	
	
	public Solver() throws Throwable {
		File inFile = new File(IN_FILE);
		if (!inFile.exists()) {
			throw new RuntimeException();
		}
		in = new BufferedReader(new FileReader(inFile));
		cases = Integer.parseInt(in.readLine());
		
		
		File outFile = new File(OUT_FILE);
		if (outFile.exists()) {
			outFile.delete();
		}
		outFile.createNewFile();
		System.setOut(new PrintStream(outFile) );

		for (int i = 0; i < cases; i++) {
			ProblemCase c = new DancingGooglersProblemCase(in);
			System.out.println(OUT_PREFIX.replaceAll("[$]", (new Integer(i+1)).toString()) + c.getResult());
		}
	}
	
	public static void main(String[] args) throws Throwable {
		new Solver();
	}
}
