#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m, kezd, veg;
    cin >> n >> m >> kezd >> veg;
    kezd--;
    veg--;
    vector<vector<int> > graph(m, vector<int>());
    for (int i=0; i<n; i++) {
        int x;
        cin >> x;
        vector<int> epp;
        for (int j=0; j<x; j++) {
            int y;
            cin >> y;
            y--;
            epp.push_back(y);
        }
        for (int q=0; q<x; q++) {
            for (int j=q+1; j<x; j++) {
                graph[epp[q]].push_back(epp[j]);
                graph[epp[j]].push_back(epp[q]);
            }
        }
    }

    queue<pair<int, int> > sor;
    vector<bool> volt(m, false);
    vector<int> tav(m, -1);
    sor.push({kezd, 0});
    tav[kezd]=0;
/*
    while (sor.size()>0) {
        int elso=sor.front().first;
        int hany=sor.front().second;
        sor.pop();
        if (volt[elso]==true) continue;
        tav[elso]=hany;
        volt[elso]=true;

        for (int sz : graph[elso]) {
            if (volt[sz]!=true) {
                sor.push({sz, hany+1});
            }
        }
    }*/
/*
    for (int sz : tav) {
        cout << sz << " ";
    }*/
    cout << tav[veg];
}