Write a program that takes as input a directed graph (in the format described below) and outputs (I) YES or NO depending on whether the graph is a DAG, and, (II) in case it is a DAG, it outputs a linear ordering of the DAG, and, (III) in case it is a DAG, outputs the length of the longest path in the DAG starting from vertex 1.