Each of Farmer John's n cows has a favorite color. The cows are conveniently labeled 1..n (as always), and each color can be represented by an integer in the range 1..n.

There exist m pairs of cows (a, b) such that cow b admires cow a (1 ≤ m ≤ 2 * 105). It is possible that a = b, in which case a cow admires herself. For any color c, if cows x and y both admire a cow with favorite color c, then x and y 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..n in that order).

Input

The first line contains n (1 ≤ n ≤ 2 * 105) and m. The next m lines each contain two space-separated integers a and b (1 ≤ a, b ≤ n), denoting that cow b admires cow a. The same pair may appear more than once in the input.

Output

For each i in 1..n, output the color of cow i in the desired assignment on a new line.

Example

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