#include <bits/stdc++.h>

using namespace std;

const int N = 405, M = 805, P = 998244353;

int vis[N][M], f[N][M][N][2];

signed main() {
    int n, m = 0; scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        int S; scanf("%d", &S);
        for (int j = 1, x; j <= S; ++j) {
            scanf("%d", &x), vis[i][x] = 1;
            m = max(m, x);
        }
    }
    for (int i = 0; i <= m; ++i) {
        f[1][i][n][0] = 1;
    }
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j <= m; ++j) if (vis[i][j]) {
            for (int k = 0; k <= n; ++k) {
                if (!f[i][j][k][0] && !f[i][j][k][1]) continue;
                for (int l = j; l <= m; ++l) {
                    int nv = max(l - j - k, 0), nk = k - (l - j - nv);
                    if (nk >= n) --nk;
                    ++nk;
                    f[i + 1][l][nk][0] = (f[i + 1][l][nk][0] + f[i][j][k][0]) % P;
                    f[i + 1][l][nk][1] = (f[i + 1][l][nk][1] + f[i][j][k][1]) % P;
                    f[i + 1][l][nk][1] = (f[i + 1][l][nk][1] + 1ll * f[i][j][k][0] * nv) % P;
                }
            }
        }
    }
    int res = 0;
    for (int i = 0; i <= m; ++i) if (vis[n][i]) {
        for (int j = 0; j <= n; ++j) {
            ((res += f[n][i][j][1]) >= P) && (res -= P);
        }
    }
    printf("%d\n", res);
    return 0;
}