A10791 | Sherlock's bet to Moriarty

Sherlock met Moriarty for a final battle of wits. He gave him a regular $n$ sided convex polygon. In addition to it, he gave him certain diagonals to form regions on the polygon. It was guaranteed that the diagonals did not intersect in interior points.

He took each of the region and calculated its importance value. Importance value for a region formed by vertices $a_{1},a_{2},...\ ,a_{x}$ of the polygon will be given by $2^{a_{1}}+2^{a_{2}}+...+2^{a_{x}}$ . Then, he sorted these regions on the basis of their importance value in ascending order. After that he assigned each region an index from $1$ to $k$ , where $k$ is the number of regions, and index of region is its position in the sorted array calculated above.

He wants Moriarty to color the regions using not more than $20$ colors, such that two regions have same color only if all the simple paths between these two regions have at least one region with color value less than the color value assigned to these regions. Simple path between two regions $f$ and $h$ is a sequence of regions $r_{1},r_{2},...\ r_{t}$ such that $r_{1}=f$ , $r_{t}=h$ , for each $1<=i<t$ regions $r_{i}$ and $r_{i+1}$ share an edge, and $r_{i}=r_{j}$ if and only if $i=j$ .

Moriarty couldn't answer and asks Sherlock to solve it himself. Help Sherlock in doing so.

First line contains two integers $n$ and $m$ ( $3<=n<=100000$ , $0<=m<=n-3$ ), the number of vertices in the polygon and the number of diagonals added.

Each of the next $m$ lines contains two integers $a$ and $b$ ( $1<=a,b<=n$ ), describing a diagonal between vertices $a$ and $b$ . It is guaranteed that the diagonals are correct, i. e. $a$ and $b$ don't coincide and are not neighboring. It is guaranteed that the diagonals do not intersect.

Let the number of regions be $k$ .

Output $k$ space-separated integers, each between $1$ and $20$ , representing the colors of the regions in the order of increasing importance.

If there are multiple answers, print any of them. It can be shown that at least one answer exists.