#include #include #include using namespace std; using namespace atcoder; using mint = modint998244353; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 4000000000000000001 int main(){ int n,m; cin>>n>>m; vector> E(n); rep(i,m){ int a,b; cin>>a>>b; a--,b--; E[a].push_back(b); } vector d(n,vector(4,Inf32)); d[0][0] = 0; queue> Q; Q.emplace(0,0); while(Q.size()>0){ int x = Q.front().first,y = Q.front().second; Q.pop(); rep(i,E[x].size()){ int tx = E[x][i]; int ty = y; if(tx==n-2)ty |= 1; if(tx==n-1)ty |= 2; if(d[tx][ty]==Inf32){ d[tx][ty] = d[x][y]+1; Q.emplace(tx,ty); } } } int ans = d[0][3]; if(ans==Inf32)ans =-1; cout<