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

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
//using mint = prime_modint<1000000007>;
using mint = prime_modint<998244353>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k, u, v;
    cin >> n >> k;
    vector<vector<pair<int,int>>> edge(k);
    for(int i = 0; i < k; i++){
        int c;
        cin >> c;
        edge[i].resize(c);
        for(int j = 0; j < c; j++){
            int u, v;
            cin >> u >> v;
            u--, v--;
            edge[i][j] = make_pair(u, v);
        }
    }
    auto LF = [&](vector<vector<mint>> &A) -> mint {
        mint res = 1;
        for(int i = 0; i + 1 < A.size(); i++){
            int pivot = -1;
            for(int j = i; j + 1 < A.size(); j++){
                if(A[j][i].v != 0){
                    pivot = j;
                    break;
                }
            }
            if(pivot == -1) return 0;
            if(pivot != i){
                swap(A[pivot], A[i]);
                res *= -1;
            }
            res *= A[i][i];
            mint div = mint(1) / A[i][i];
            for(int j = i; j + 1 < A[i].size(); j++) A[i][j] *= div;
            for(int j = i + 1; j + 1 < A.size(); j++){
                mint coef = A[j][i];
                for(int k = i; k + 1 < A[j].size(); k++){
                    A[j][k] -= coef * A[i][k];
                }
            }
        }
        return res;
    };
    mint ans;
    for(int i = 0; i < (1 << k); i++){
        vector<vector<mint>> A(n, vector<mint>(n));
        for(int j = 0; j < k; j++){
            if(~i >> j & 1) continue;
            for(auto &&pa : edge[j]){
                tie(u, v) = pa;
                A[u][v]--, A[v][u]--;
                A[u][u]++, A[v][v]++;
            }
        }
        ans += (k - __builtin_popcount(i) & 1 ? -1 : 1) * LF(A);
    }
    cout << ans << '\n';
}