In the coastal hub of Tidewater, Aria the log keeper keeps careful count of the tunnels. rank apprentices for the new term, every figure matters. 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 <= 1016; 0 <= m <= 2032.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1016; 0 <= m <= 2032.
