Each of Farmer John's NN cows (1≤N≤2⋅1051≤N≤2⋅105) has a favorite color. The cows are conveniently labeled 1…N1…N (as always), and each color can be represented by an integer in the range 1…N1…N.There exist MM pairs of cows (a,b)(a,b) such that cow bb admires cow aa (1≤M≤2⋅1051≤M≤2⋅105). It is possible that a=ba=b, in which case a cow admires herself. For any color cc, if cows xx and yy both admire a cow with favorite color cc, then xx and yy share the same favorite color.

Given this information, determine an assignment of cows to favorite colors such that the number of distinct favorite colors among all cows is maximized. As there are multiple assignments that satisfy this property, output the lexicographically smallest one (meaning that you should take the assignment that minimizes the colors assigned to cows 1…N1…N in that order).

INPUT FORMAT (file fcolor.in):

The first line contains NN and MM.The next MM lines each contain two space-separated integers aa and bb (1≤a,b≤N1≤a,b≤N), denoting that cow bb admires cow aa. The same pair may appear more than once in the input.

OUTPUT FORMAT (file fcolor.out):

For each ii in 1…N1…N, output the color of cow ii in the desired assignment on a new line.

SAMPLE INPUT:

9 12
1 2
4 2
5 8
4 6
6 9
2 9
8 7
8 3
7 1
9 4
3 5
3 4

SAMPLE OUTPUT:

1
2
3
1
1
2
3
2
3

In the image below, the circles with bolded borders represent the cows with favorite color 1.

SCORING:

• Test cases 2-3 satisfy N,M≤103N,M≤103.
• Test cases 4-10 satisfy no additional constraints.