Before the gates of the pearl fisheries of Nacre Bay close for winter, Theo must finish the routes ledger - one figure at a time. 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 <= 2034; 0 <= m <= 4068.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2034; 0 <= m <= 4068.
