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.util.Scanner;

public abstract class ProgrammingProblem
{

	protected static final Scanner sc = new Scanner(System.in);

	protected static boolean DEBUG = false;
	protected abstract void print();

	protected abstract void readInput();

	protected abstract String execute();

	protected static void main(@SuppressWarnings("rawtypes") Class myclass) throws InstantiationException, IllegalAccessException
	{
		int T = sc.nextInt();
	
		for (int i = 0; i < T; i++)
		{
			ProgrammingProblem m = (ProgrammingProblem) myclass.newInstance();
			m.readInput();
			if (DEBUG)
			{
				m.print();				
			}
	
			System.out.println("Case #" + (i+1) + ": " + m.execute());
		}
	
	}

	protected static ProgrammingProblem getTestCase()
	{
		return null;
	}

	public ProgrammingProblem()
	{
		super();
	}

}