#include <bits/stdc++.h>
using namespace std;
const int N = 100 + 5;
const int mod = 998244353;
int n, ans, s0, T, inv[N], f[N][N], g[N][N];
vector <int> e[N];
int main() {
	cin >> n >> s0 >> T, inv[1] = 1;
	for(int i = 2; i < N; i++) inv[i] = mod - 1ll * mod / i * inv[mod % i] % mod;
	for(int i = 1; i <= n; i++) {
		int m, id; scanf("%d", &m);
		for(int j = 1; j <= m; j++) scanf("%d", &id), e[i].push_back(id);
	}
	for(int i = 1; i <= n; i++) {
		memset(f, 0, sizeof(f));
		for(int it : e[i]) f[1][it] = 1ll * it * inv[e[i].size()] % mod;
		for(int j = 0; j < T; j++) {
			for(int k = 1; k <= n; k++)
				if(f[j][k] && k != i) {
					int v = 1ll * f[j][k] * inv[e[k].size()] % mod;
					for(int it : e[k]) f[j + 1][it] = (f[j + 1][it] + v) % mod;
				}
			g[i][j + 1] = f[j + 1][i];
		}
	}
	memset(f, 0, sizeof(f)), f[0][s0] = 1;
	for(int i = 0; i < T; i++) {
		for(int j = 1; j <= n; j++)
			if(f[i][j]) {
				for(int k = 1; k + i <= T; k++)
					ans = (ans + 1ll * f[i][j] * g[j][k] % mod) % mod;
				int v = 1ll * f[i][j] * inv[e[j].size()] % mod;
				for(int it : e[j]) f[i + 1][it] = (f[i + 1][it] + v) % mod;
			}
	}
	for(int i=  1; i <= n; i++)
		for(int j = 0; j <= T; j++)
			cout << i << " " << j << " " << f[j][i] << endl;
	cout << ans << endl;
	return 0;
}