Building Teams

n, m = map(int, input().split())
h = [[] for i in range(n+1)]
for t in range(m):
    a,b = map(int, input().split())
    h[a].append(b)
    h[b].append(a)
k = [0]*(n+1)
s=True

for i in range(1,n+1):
    if k[i]==0:
        k[i] = 1
        q =[i]
        for j in q:
            for l in h[j]:
                if k[l] == 0:
                    k[l] = 3-k[j]
                    q.append(l)
                elif k[l] == k[j]:
                    s = False

if s:
    print(*(k[1:]))
else:
    print("IMPOSSIBLE")

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED