Building Teams

(n, m) = map(int,  input().split())

friendships = set()

while m > 0:
    m -= 1
    (x, y) = map(int, input().split())
    friendships.add((x, y))
    friendships.add((y, x))

team1 = set()
team2 = set()


def get_all_friends(i):
    friends = set()
    for j in range(1, n + 1):
        if (i, j) in friendships:
            friends.add(j)
    return friends


def any_in_team(friends, team):
    for friend in friends:
        if friend in team:
            return True
    return False


for i in range(1, n + 1):
    if not any_in_team(get_all_friends(i), team1):
        team1.add(i)
    elif not any_in_team(get_all_friends(i), team2):
        team2.add(i)
    else:
        print("IMPOSSIBLE")
        exit(0)

for i in range(1, n + 1):
    if i in team1:
        if i != n:
            print(1, end=' ')
        else:
            print(1)
    else:
        if i != n:
            print(2, end=' ')
        else:
            print(2)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

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