Every season at the gull cliffs of Screech Point, someone must rank apprentices for the new term. This year the task falls to Pavel, armed only with the roads 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 <= 1224; 0 <= m <= 2448.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1224; 0 <= m <= 2448.
