#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using ll = long long;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }
ll fac[N], inv[N], p[N];
void init() {
    p[0] = 1, p[1] = qmi(2, MOD - 2, MOD);
    for (int i = 2; i < N; i++) p[i] = p[i - 1] * p[1] % MOD;
    fac[0] = 1;
    for (int i = 1; i < N; i++) fac[i] = fac[i - 1] * i % MOD;
    inv[N - 1] = qmi(fac[N - 1], MOD - 2, MOD);
    for (int i = N - 2; i > -1; i--) inv[i] = inv[i + 1] * (i + 1) % MOD;
}

ll C(int a, int b) { if (a < b) return 0; return fac[a] * inv[b] % MOD * inv[a - b] % MOD; }

int c[N / 10][31];
void solve() {
    scanf("%d%d", &n, &m);
    while (m--) {
        int l, v, x;
        scanf("%d%d", &l, &v);
        while (l--) {
            scanf("%d", &x);
            for (int i = 0; i < 30; i++)
                c[x][i] += v >> i & 1;
        }
    }
    ll res = 0;
    for (int i = 1; i < n + 1; i++)
        for (int j = 0; j < 30; j++)
            for (int k = 1; k <= c[i][j]; k += 2)
                res = (res + (1ll << j) * C(c[i][j], k) % MOD * p[c[i][j]]) % MOD;
    printf("%lld\n", res);
}

int main() {
    init();
    int T = 1;
    // scanf("%d", &T);
    while (T--) solve();
    return 0;
}