import sys
from itertools import permutations
from heapq import *

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 998244353

def det(G, mod):
    N = len(G)
    res = 1
    for i in range(N):
        for h in range(i, N):
            if G[h][i]:
                break
        if i != h:
            G[i], G[h] = G[h][:], G[i][:]
        gii = G[i][i]
        res = res*gii%mod
        giiv = pow(gii, mod-2, mod)
        for w in range(i, N):
            G[i][w] = G[i][w]*giiv%mod

        for j in range(i+1, N):
            gji = G[j][i]
            if gji:
                for w in range(i, N):
                    G[j][w] = (G[j][w]-gji*G[i][w])%mod
    return res

def calc_tree(N,A):
    return det([A[i][:N-1] for i in range(N-1)],mod)

N,K = mi()
edge = [[] for i in range(K)]
for i in range(K):
    t = int(input())
    for _ in range(t):
        a,b = mi()
        edge[i].append((a-1,b-1))

ans = 0

for S in range(1<<K):
    A = [[0]*N for i in range(N)]
    p = 0
    for i in range(K):
        if S>>i & 1 == 0:
            for a,b in edge[i]:
                A[a][a] += 1
                A[b][b] += 1
                A[a][b] -= 1
                A[b][a] -= 1
        else:
            p += 1

    if p & 1 == 0:
        ans += calc_tree(N,A)    
    else:
        ans -= calc_tree(N,A)
    ans %= mod

print(ans)