#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

mint calc(int n, vector<vector<mint>> A){
    mint ret = 1;
    n--;
    vector<vector<mint>> B(n,vector<mint>(n));
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) B[i][j] = A[i][j];
    for (int i = 0; i < n; i++) {
        int idx = -1;
        for (int j = i; j < n; j++) {
            if (B[j][i] != 0) {
                idx = j;
                break;
            }
        }
        if (idx == -1) return 0;
        if (i != idx) {
            ret *= -1;
            swap(B[i], B[idx]);
        }
        ret *= B[i][i];
        mint inv = B[i][i].inv();
        for (int j = 0; j < n; j++) {
            B[i][j] *= inv;
        }
        for (int j = i + 1; j < n; j++) {
            mint a = B[j][i];
            if (a == 0) continue;
            for (int k = i; k < n; k++) {
                B[j][k] -= B[i][k] * a;
            }
        }
    }
    return ret;
}

int main(){
    int n, k; cin >> n >> k;
    vector<vector<pair<int,int>>> es(k);
    for (int i = 0; i < k; i++){
        int t; cin >> t;
        es[i].resize(t);
        for (int j = 0; j < t; j++){
            int u, v; cin >> u >> v; u--, v--;
            es[i][j] = make_pair(u,v);
        }
    }
    mint ans = 0;
    for (int s = 0; s < 1<<k; s++){
        vector<vector<mint>> g(n,vector<mint>(n));
        for (int i = 0 ; i < k; i++){
            if (s >> i & 1){
                for (auto [u, v] : es[i]){
                    g[u][v]--;
                    g[v][u]--;
                    g[u][u]++;
                    g[v][v]++;
                }
            }
        }
        ans += (popcount((unsigned int)s) % 2 == k % 2 ? 1 : -1) * calc(n,g);
    }
    cout << ans.val() << endl;
}