Petr runs the customs house at the obsidian flows of Blackglass. Today the books show a list of corridors, and the numbers must be worked out before sundown. Task: Print the minimum number of edges on a path from s to t, or -1. Input format: First line: n m s t. Next m lines: u v. Output format: Print the BFS distance or -1. Constraints: 1 <= n <= 662; 0 <= m <= 1324.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 662; 0 <= m <= 1324.
