The council of the ivy courts of Vineward pays by the answer, and Diya intends to earn it. First: the full register of corridors. 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 <= 2541; 0 <= m <= 5082.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2541; 0 <= m <= 5082.
