Undirected unweighted graph is given. Find the shortest path between two vertices of even length.
The first line contains four integers: number of vertices , number of edges , source and destination . Each of the next lines contains two integers and describing an undirected edge .
Print the shortest distance from to . The length of the path (number of edges in the path) must be even. If there is no path of even length between and , print .