FC Porto and SL Benfica are the two largest football teams in Portugal. Naturally, when the two play each other, a lot of people travel from all over the country to watch the game. This includes the Benfica supporters' club, which is going to travel from Lisbon to Porto to watch the upcoming game. To avoid tensions between them and the Porto supporters' club, the national police want to delay their arrival to Porto as much as they can. The road network in Portugal can be modelled as a simple, undirected, unweighted, connected graph with (n) vertices and (m) edges, where vertices represent towns and edges represent roads. Vertex (1) corresponds to Lisbon, i.e., the starting vertex of the supporters' club, and vertex (n) is Porto, i.e., the destination vertex of the supporters' club. The supporters' club wants to minimize the number of roads they take to reach Porto. The police are following the supporters' club carefully, and so they always know where they are. To delay their arrival, at any point the police can pick exactly one road and block it, as long as the supporters' club isn't currently traversing it. They can do this exactly once, and once they do that, the road is blocked forever. Once the police block a road, the supporters' club immediately learns that that road is blocked, and they can change their route however they prefer. Furthermore, the supporters' club knows that the police are planning on blocking some road and can plan their route accordingly. Assuming that both the supporters' club and the police always make optimal choices, determine the minimum number of roads the supporters' club needs to traverse to go from Lisbon to Porto. If the police can block the supporters' club from ever reaching Porto, then output (-1). The first line contains two integers (n) and (m) ((2 \leq n \leq 200\,000), (n - 1 \leq m \leq \min\{n(n - 1)/2, 200\,000\})) — the number of towns and the number of roads in the road netw