#include<bits/stdc++.h>
using namespace std;

long long determinant(std::vector<std::vector<long long>> A){

    const long long mod = 998244353;
    std::function<long long(long long)> GFinv = [&](long long b){
        long long e = mod-2;
        long long r=1;
        while(e){
            if(e&1){
                r=(r*b)%mod;
            }
            b=(b*b)%mod;
            e >>=1;
        }
        return r;
    };

    int N=A.size();
    long long det = 1;

    for(int i=0;i<N;i++){
        // A_{i,i},...,A_{N-1,i}に非ゼロがないか探す
        int l = -1;
        for(int k=i;k<N;k++){
            if(A[k][i]!=0){
                l = k;
                break;
            }
        }

        if(l==-1){
            return 0;
        }

        if(i!=l){
            swap(A[i],A[l]);
            det = mod-det;
        }
        
        det = (det*A[i][i])%mod;
        long long con = GFinv(A[i][i]);
        for(int j=i;j<N;j++){
            A[i][j] = (A[i][j]*con)%mod;
        }
        for(int k=0;k<N;k++){
            if(k==i)continue;
            long long pro = A[k][i];
            for(int j=i;j<N;j++){
                A[k][j] = (A[k][j] + mod - (pro*A[i][j])%mod)%mod;
            }
        }
    }

    return det;
}


int main(){
    
    const long long MOD = 998244353;
    long long N,K;
    cin >> N >> K;
    vector<vector<pair<long long,long long>>> E(K);
    for(int k=0;k<K;k++){
        long long t;
        cin >> t;
        E[k].resize(t);
        for(int i=0;i<t;i++){
            long long a,b;
            cin >> a >> b;
            a--;b--;
            if(a>b)swap(a,b);
            E[k][i] = {a,b};
        }
    }

    long long Ans = 0;
    for(long long j=0;j<(1<<K);j++){

        long long num = 0;
        vector<vector<long long>> L(N-1,vector<long long>(N-1,0));

        for(int k=0;k<K;k++){
            if((j>>k)%2==0)continue;
            num++;

            for(pair<long long,long long> p:E[k]){
                long long a = p.first, b = p.second;
                if(a!=N-1)L[a][a]++;
                if(b!=N-1)L[b][b]++;
                if(a!=N-1 && b!=N-1)L[a][b]--;
                if(a!=N-1 && b!=N-1)L[b][a]--;
            }

            for(int i=0;i<N-1;i++){
                for(int l=0;l<N-1;l++){
                    L[i][l] = (L[i][l]+MOD)%MOD;
                }
            }
        }

        long long d = determinant(L);
        if((num+K)%2==1){
            d = MOD-d;
        }
        Ans = (Ans+d)%MOD;

    }

    cout << Ans << endl;

}