mod = 998244353

def matrix_tree_theory(mat, N):
    ret = 1
    for i in range(N-1):
        if mat[i][i] == 0:
            for j in range(i+1, N-1):
                if mat[j][i]:
                    for k in range(N-1):
                        mat[i][k], mat[j][k] = mat[j][k], mat[i][k]
                        ret *= -1
                        ret = (ret + mod) % mod
                    break

        if mat[i][i] == 0:
            return 0

        for j in range(i+1, N-1):
            if mat[j][i]:
                mul = (mat[j][i] * pow(mat[i][i], -1, mod)) % mod
                
                for k in range(i, N-1):
                    mat[j][k] = (mat[j][k] -  (mul * mat[i][k]) % mod + mod) % mod
    
    for i in range(N-1):
        ret = (ret * mat[i][i]) % mod

    return ret

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

for i in range(K):
    for j in range(N):
        sum = 0
        for k in range(N):
            sum += G[i][j][k]
        sum = (-sum + mod) % mod 
        G[i][j][j] = sum

ans = 0
for i in range(1<<K):
    mat = [[0 for _ in range(N)] for _ in range(N)]
    cnt = 0
    for j in range(K):
        if i & 1<<j:
            cnt += 1
            for a in range(N):
                for b in range(N):
                    mat[a][b] += G[j][a][b]
    
    if (K-cnt) % 2 == 0:
        ans += matrix_tree_theory(mat, N)
    else:
        ans -= matrix_tree_theory(mat, N)
        
print(ans)