#include<bits/stdc++.h>

using namespace std;
const long long mod = 998244353;

int main(){
    int N, K;
    cin >> N >> K;
    vector G(K, vector(N, vector(N, 0LL)));
    for(int i = 0;i < K;i++){
        int t;
        cin >> t;
        for(int j = 0;j < t;j++){
            int a, b;
            cin >> a >> b;
            --a;--b;
            G[i][a][b] += 1;
            G[i][b][a] += 1;
        }
    }

    vector<vector<long long>> dp(N+1, vector<long long>(1<<K, 0));
    dp[1][0] = 1;


    for(int i = 1;i < N;i++){
        //各iについて、iとi以下をつなぐものを事前計算
        vector<long long> cnt(K);
        for(int j = 0;j < K;j++){
            for(int k = 0;k < i;k++){
                cnt[j] += G[j][k][i];
                cnt[j] %= mod;
            }
        }
        
        for(int j = 0;j < 1<<K;j++){
            for(int k = 0;k < K;k++){
                dp[i+1][j | 1<<k] += (cnt[k] * dp[i][j]) % mod;
                dp[i+1][j | 1<<k] %= mod;
            }
        }
    }

    cout << dp[N][(1<<K)-1] << endl;

}