The council of the fen lights of Will-o-Wisp pays by the answer, and Tanya intends to earn it. First: the full register of roads. 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 <= 1912; 0 <= m <= 3824.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1912; 0 <= m <= 3824.
