Finn found an old ledger of tunnels in the kitchen attic at the railway depot of Cinderline. The margin notes pose a precise question. 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 <= 1570; 0 <= m <= 3140.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1570; 0 <= m <= 3140.
