import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 62) # md = 10**9+7 md = 998244353 from collections import deque n,m,s,g=LI() s,g=s-1,g-1 to=[[] for _ in range(n)] for _ in range(m): u,v=LI1() to[u].append(v) to[v].append(u) q=deque() dist=[-1]*n q.append(s) dist[s]=0 pre=[-1]*n while q: u=q.popleft() for v in to[u]: if dist[v]==-1: dist[v]=dist[u]+1 q.append(v) pre[v]=u if dist[g]==-1: print(-1) exit() uu=[g] while pre[uu[-1]]!=-1:uu.append(pre[uu[-1]]) uu.reverse() u2i={u:i for i,u in enumerate(uu)} ng=set() for u,v in zip(uu,uu[1:]): ng.add((u,v)) ng.add((v,u)) def dfs(u): mx=-1 st=[u] vis[u]=1 while st: u=st.pop() if u in u2i:mx=max(mx,u2i[u]) for v in to[u]: if vis[v] or (u,v) in ng:continue vis[v]=1 st.append(v) return mx d=len(uu) imo=[0]*d vis=[0]*n for u in uu: if vis[u]:continue i=dfs(u) # print(u,i) imo[u2i[u]]+=1 imo[i]-=1 for i in range(d-1):imo[i+1]+=imo[i] # print(imo) print(d-imo.count(0))