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

int main() {
	int n,m,x,y; cin >>n>>m>>x>>y;
	vector<set<int>> a(m+1);
	vector<vector<int>> v(n+1);
	vector<int> dist(m+1,-1);
	vector<bool> used(n+1);
	vector<vector<int>> ut(m+1, vector<int>(2));
	vector<int> ans;
	dist[x] = 0;
	for(int i = 1; i <= n; i++) {
		int b; cin >> b;
		v[i].assign(b,0);
		for(int j = 0; j < b; j++) {
			cin >> v[i][j];
			a[v[i][j]].insert(i);
		}
	}
	queue<int> q;
	q.push(x);
	while(q.size() != 0) {
		int u = q.front(); q.pop();
		for(int i : a[u]) {
			if(used[i] == false) {
				used[i] = true;
				for(int j : v[i]) {
					if(dist[j] == -1) {
						dist[j] = dist[u] + 1;
						ut[j][0] = u;
						ut[j][1] = i;
						q.push(j);
					}
				}
			}
		}
	}
	if(dist[y] == -1) cout << -1;
	else {
		int z = y;
		while(z != x) {
			ans.push_back(ut[z][1]);
			z = ut[z][0];
		}
		reverse(begin(ans), end(ans));
		cout << dist[y] <<endl;
		for(int i : ans) cout << i << " ";

	}
}