#include <bits/stdc++.h>
using namespace std;
#if __has_include("all.hpp")
#include "all.hpp"
#else
#include <atcoder/all>
#endif
using namespace atcoder;
using mint =modint998244353;
const int MOD = 998244353;

vector<long long> fact, fact_inv, inv;

void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}

long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}
int main(void){
    init_nCk(500000);
    int n,k;
    cin>>n>>k;
    vector<int>v[n];
    for(int i=0;i<k;i++){
        int l,s;
        cin>>l>>s;
        for(int j=0;j<l;j++){
            int b;
            cin>>b;
            v[b-1].push_back(s);
        }
    }
    mint p2=2,bb=p2.pow(k),bs=0;
    for(int i=0;i<n;i++){
        mint tmp=0;
        for(int j=0;j<30;j++){
            int t2=0;
            for(int l=0;l<v[i].size();l++){
                if(v[i][l]&(1<<j)){
                    t2++;
                }
            }
            for(int l=1;l<=t2;l+=2){
                tmp+=p2.pow(k-t2)*p2.pow(j)*nCk(t2,l);
            }
        }
        bs+=tmp;
    }
    cout<<(bs/bb).val()<<endl;
    return 0;
}