N, K = map(int, input().split())
G = [[[0 for _ in range(N)] for _ in range(N)] for _ in range(K)]
t = []
mod = 998244353

for i in range(K):
    tmp = int(input())
    t.append(tmp)
    for j in range(t[i]):
        a, b = map(int, input().split())
        G[i][a-1][b-1] += 1
        G[i][b-1][a-1] += 1


dp = [[0 for _ in range(1<<K)] for _ in range(N+1)]
dp[1][0] = 1

for i in range(1, N):
    cnt = [0] * K
    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])