import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
md = 10**9+7

n,m=MI()
cc,yy=[],[]
for i in range(m):
    II()
    c=sum(1<<b-1 for b in MI())
    y=II()
    cc.append(c)
    yy.append(y)

def swap(i,j):
    cc[i],cc[j]=cc[j],cc[i]
    yy[i],yy[j]=yy[j],yy[i]

for i in range(m):
    mx=max(cc[i:])
    j=cc.index(mx)
    if i!=j:swap(i,j)
    c,y=cc[i],yy[i]
    if c==0:
        if y==0:continue
        else:
            print(-1)
            exit()
    j=c.bit_length()-1
    for ni in range(i+1,m):
        if cc[ni]>>j&1:
            cc[ni]^=c
            yy[ni]^=y
# for c,y in cy:print(bin(c),y)

xx=[-1]*n
for c,y in zip(cc[::-1],yy[::-1]):
    if c==0:continue
    pen=[]
    for i in range(n):
        if c>>i&1:
            if xx[i]==-1:pen.append(i)
            else:y^=xx[i]
    while len(pen)>1:
        i=pen.pop()
        xx[i]=0
    i=pen.pop()
    xx[i]=y

print(*xx,sep="\n")