import java.util.Scanner;
import java.io.FileReader;
import java.io.FileNotFoundException;
public class DemoReachability {
    public static void main(String[] args) throws FileNotFoundException {
	Scanner getFileInput = new Scanner(new FileReader("input"));

	// first input is number of nodes
	Reachability reach = new Reachability(getFileInput.nextInt());

	// next inputs are the incident nodes (with a count per node)
	for (int i=0; i<reach.getNumNodes(); i++) {
	    reach.setNumArcs(i, getFileInput.nextInt());
	    for (int j=0; j<reach.getNumArcs(i); j++)
		reach.setArcs(i, j, getFileInput.nextInt());
	}

	reach.printArcs();

	Scanner getKeyboardInput = new Scanner(System.in);
	while (true) {
	    System.out.print("Which node (negative to end)?  ");
	    int node = getKeyboardInput.nextInt();
	    System.out.println();
	    if (node < 0)
		System.exit(0);
	    reach.printReachability(node, reach.calcReachability(node));
	}

    }
}
// Local Variables:
// c-basic-offset: 4
// compile-command: "javac DemoReachability.java"
// End: