import sys
import numpy as np


def solve():
    inp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')
    N, K = inp[:2]
    G = np.zeros((K, N, N), dtype=np.int64)
    mod = 998244353
    idx = 2
    for i in range(K):
        tmp = inp[idx]
        idx += 1
        for j in range(tmp):
            a, b = inp[idx:idx+2]
            idx += 2
            G[i,a-1,b-1] += 1
            G[i,b-1,a-1] += 1


    dp = np.zeros((N+1, 1<<K), dtype=np.int64)
    dp[1,0] = 1

    for i in range(1, N):
        cnt = np.zeros(K, dtype=np.int64)
        for j in range(K):
            for k in range(i):
                cnt[j] += G[j, k, i]
                cnt[j] %= mod
        
        for j in range(1<<K):
            for k in range(K):
                dp[i+1, j | 1<<k] += (dp[i, j] * cnt[k]) % mod
                dp[i+1, j | 1<<k] %= mod

    print(dp[N, (1<<K)-1])
    return

if __name__ == '__main__':
    solve()