Problem:
Score : 500 points

Problem Statement

Ken loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.
G consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.

First, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.

Determine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.

Constraints

2 \leq N \leq 10^5

0 \leq M \leq \min(10^5, N (N-1))

1 \leq u_i, v_i \leq N(1 \leq i \leq M)

u_i \neq v_i (1 \leq i \leq M)

If i \neq j, (u_i, v_i) \neq (u_j, v_j).

1 \leq S, T \leq N

S \neq T

Input

Input is given from Standard Input in the following format:

N M
u_1 v_1
:
u_M v_M
S T

Output

If Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.
If he can, print the minimum number of ken-ken-pa needed to reach vertex T.

Sample Input 1

4 4
1 2
2 3
3 4
4 1
1 3

Sample Output 1

2

Ken can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \rightarrow 2 \rightarrow 3 \rightarrow 4 in the first ken-ken-pa, then 4 \rightarrow 1 \rightarrow 2 \rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.

Sample Input 2

3 3
1 2
2 3
3 1
1 2

Sample Output 2

-1

Any number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.

Sample Input 3

2 0
1 2

Sample Output 3

-1

Vertex S and Vertex T may be disconnected.

Sample Input 4

6 8
1 2
2 3
3 4
4 5
5 1
1 4
1 5
4 6
1 6

Sample Output 4

2

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

N,M=gets.chomp.split.map(&:to_i)
e1 = Array.new(N+1).map{Array.new}
M.times do
  u,v=gets.chomp.split.map(&:to_i)
  e1[u] << v
end
s,t=gets.chomp.split.map(&:to_i)
e2 = Array.new(N+1).map{Array.new}
1.upto(N) do |i|
  e1[i].each do |j|
    e1[j].each do |k|
      e1[k].each do |l|
        e2[i] << l if l != i && !e2[i].include?(l)
      end
    end
  end
end

visited = Array.new(N+1,10**10)

def dfs(s,t, e, visited, d)
  return d if s == t
  return -1 if visited[s] < d && visited[s] != 10**10
  visited[s] = d
  ret = 10**10
  e[s].each do |v|
    return d+1 if v == t

    tmp = dfs(v, t, e, visited, d+1)
    ret = tmp if (tmp < ret && tmp != -1)
  end
  return ret
end

ret =  dfs(s,t,e2,visited,0)
if ret < 0 || ret == 10**10
  puts -1
else
  puts ret
end