n,m = [int(i) for i in input().split()]
g = [[] for i in range(n+1)]
for i in range(m):
    x,y = [int(i) for i in input().split()]
    g[x].append(y)
    g[y].append(x)

result = []
stack = [(1, True)]
visited = [False]*(n+1)
while len(stack)>0:
    v,b = stack.pop()
    if v==0:
        result.append(b)
        continue
    if visited[v]: continue
    visited[v] = True
    if b: stack.append((0,v))
    for w in g[v]: stack.append((w, not b))
    if not b: stack.append((0,v))
print(*result)