#include <iostream>
#include <vector>

using namespace std;

vector<int> sol;
vector<vector<int>> rows;
vector<vector<int>> p;

int n, m, s, e;

int INTMAX = 0x7FFFFFFF;

static bool inVector(vector<int>& v, int a)
{
	for (int x : v)
	{
		if (x == a) return true;
	}
	return false;
}

static vector<int> Finder(int index, vector<int>& come)
{
	vector<int> lsol;
	int lmin = INTMAX;
	int ideal = -1;
	vector<int> ccopy = come;
	vector<int> been;
	for (int rIndex : p[index])
	{
		if (inVector(been, rIndex)) continue;
		if (inVector(come, rIndex)) continue;

		been.push_back(rIndex);

		int size = rows[rIndex].size();
		for (int i = 0; i < size; i++)
		{
			int val = rows[rIndex][i];
			if (val == e)
			{
				return vector<int> { rIndex + 1 };
			}
		}
		vector<int> csol;

		for (int i = 0; i < size; i++)
		{
			int val = rows[rIndex][i];
			if (val == index) continue;

			ccopy.push_back(rIndex);

			csol = Finder(val, ccopy);

			ccopy.pop_back();

			int size = csol.size();
			if (size < lmin)
			{
				ideal = rIndex;
				lsol = csol;
			}
		}
	}
	lsol.insert(lsol.begin(), ideal + 1);
	return lsol;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin >> n >> m >> s >> e;

	s--;
	e--;

	for (int i = 0; i < m; i++)
	{
		p.push_back(vector<int>{});
	}

	for (int i = 0; i < n; i++)
	{
		rows.push_back(vector<int>{});
		int x;
		cin >> x;
		for (int j = 0; j < x; j++)
		{
			int y;
			cin >> y;
			y--;
			rows[i].push_back(y);
			p[y].push_back(i);
		}
	}
	vector<int> a{};

	sol = Finder(s, a);

	if (sol.size() == 0)
	{
		cout << -1;
	}
	else
	{
		cout << sol.size() << endl;
		for (int x : sol)
		{
			cout << x << " ";
		}
	}
}