Building Teams

n,m = [int(x) for x in input().split()]
edges = []
for i in range(0,m):
    (a,b) = input().split()
    edges.append(a)
    edges.append(b)
g1 = set([1])
g2 = set([])
for i in range(1,n+1):
    l = []
    for e in range(0,m):
        if edges[2*e] in g1:
            g2.add(edges[2*e+1])
        elif edges[2*e+1] in g1:
            g2.add(edges[2*e+1])
        else:
            l.append(edges[2*e])
            l.append(edges[2*e+1])
    l = edges
    gt = g2
    g2 = g1
    g1 = gt
if len(g1.intersection(g2)) == 0:
    print("IMPOSSIBLE")
else:
    toPrint = []
    for i in range(1,n+1):
        if i in g1: 
            toPrint.append(1)
        else:
            toPrint.append(2)
    print(" ".join(toPrint))

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED