Little Santa is getting late for the Christmas eve. He took N gift and tied all of them together using M threads so that no gift will fall from his sleigh. He tied the gifts in such a way that all the gifts are connected. After tying all the gifts, he realized that he forgot to wrap the gifts in wrapping paper. Little Santa has only two types of wrapping paper (Red and White). Now, he wants to wrap all the gifts with these two types of papers in such a way that the following conditions will be satisfied:

1. Between any two gifts there should exist a path (made of threads and other gifts) such that no two adjacent gifts on that path will wrap with same color paper.

2. No two adjacent gifts should have white color. In other words, there should not be any thread which is connecting two white gifts.

Two gifts can be tied with multiple threads, but a gift can't be tied to itself.

Input format:
First line contains two space separated integers, N $(1 \le N \le 10^5)$ and M $(0 \le M \le 2*10^5)$. Next M lines contains two space separated integers each, a and b $(1 \le a, b \le N)$, denoting that gift a and b are tied with a thread.

Output format:
Print N space separated integers, $c_i$ $(0 \le c_i \le 1)$, denoting the color of wrapping paper in which $i^{th}$ gift is wrapped. Print 0 for Red color paper and 1 for White color paper. If there is no possible answer, print No.