There are N participants numbered 0 to N−1 competing in a padel tournament held over M days. Exactly one match is held each day. There are M medals handed out in the tournament, a new one for each match. In the match on day i (0≤i≤M−1), the two participants numbered x_i and y_i are participating. The following happens in the match:
On day M (the day after the last match) the prize ceremony is held. At the ceremony, all medals are collected and then each medal is given to the participant that held that medal the longest. Formally, medal i is given to the participant who held medal i for the most nights (not necessarily in a row), as of day M. If two or more participants have held a medal for the same number of nights, the medal is given to the participant with the smallest index among them.
Your goal is to determine how many medals each participant is awarded at the prize ceremony.
The first line of input contains the integers N and M, the number of participants and number of matches.
Then M lines follow. The ith of these lines contains two integers x_i and y_i, the participants competing on day i, where participant x_i beats participant y_i.
On the single line of output print N integers, the kth number denoting the number of medals that participant k has after the prize ceremony.
For the first sample test case, the following illustration shows who held which medals throughout the tournament. When participant 1 loses on the 3rd day, all her medals are given to participant 2.

The second sample can be seen below.

After the prize ceremony, participant 0 is given medals 5 and 6, participant 1 is given medals 3 and 4, and participant 2 is given medals 0, 1 and 2.