Every season at the mushroom groves of Fungaldeep, someone must verify the ledger before the auditors arrive. This year the task falls to Finn, armed only with the bridges register. 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 <= 1330; 0 <= m <= 2660.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1330; 0 <= m <= 2660.
