Directed unweighted graph is given. Find in it a vertex, the shortest distance from which to the given one is maximum, and print this distance.
First line contains three positive integers и — the number of vertices and edges in the graph and the number of given vertex. In the next lines the graph edges are given. Each edge is given with the pair of numbers — the starting and the ending point.
Print the required shortest distance.