#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr ll MOD = (ll)1e9 + 7;
constexpr ll MOD2 = 998244353;
constexpr ll HIGHINF = (ll)1e18;
constexpr ll LOWINF = (ll)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
    int N,M; cin >> N >> M;
    V<V<int>> edge(N);
    for(int i = 0; i < M; ++i){
        int u,v;
        cin >> u >> v;
        u--,v--;
        edge[u].push_back(v);
    }
    int S,T; cin >> S >> T;
    S--,T--;
    V<V<int> > vst(N,V<int>(3,0));
    V<V<ll> > dist(N,V<ll>(3,123456789));

    queue<P<int,int>> q;
    q.push({S,0});
    dist[S][0] = 0;
    vst[S][0] = 1;
    
    while(q.size()){
        int from = q.front().first;
        ll cnt = q.front().second;                
        q.pop();

        if(cnt == 0){
            for(auto to: edge[from]){
                if(vst[to][cnt+1]) continue;
                if(dist[to][cnt+1] <= dist[from][cnt] + 1) continue;
                dist[to][cnt+1] = dist[from][cnt] + 1;
                vst[to][cnt+1] = 1;
                q.push({to,cnt+1});
            }
        }

        if(cnt == 1){
            for(auto to: edge[from]){
                if(vst[to][cnt+1]) continue;
                if(dist[to][cnt+1] <= dist[from][cnt]) continue;
                dist[to][cnt+1] = dist[from][cnt];
                vst[to][cnt+1] = 1;
                q.push({to,cnt+1});
            }
        }

        if(cnt == 2){
            for(auto to: edge[from]){
                if(vst[to][0]) continue;
                if(dist[to][0] <= dist[from][cnt]) continue;
                dist[to][0] = dist[from][cnt];
                vst[to][0] = 1;
                q.push({to,0});
            }
        }
    }
    ll ans = dist[T][0];
    if(ans == 123456789) ans = -1;
    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 16640