Problem Statement

There are $N$ cities and $M$ roads. The $i$-th road $(1≤i≤M)$ connects two cities $a_i$ and $b_i$ $(1≤a_i,b_i≤N)$ bidirectionally. There may be more than one road that connects the same pair of two cities. For each city, how many roads are connected to the city?

Constraints

• $2≤N,M≤50$
• $1≤a_i,b_i≤N$
• $a_i ≠ b_i$
• All input values are integers.

Input

Input is given from Standard Input in the following format:

N M
a_1 b_1
:
a_M b_M

Output

Print the answer in $N$ lines. In the $i$-th line $(1≤i≤N)$, print the number of roads connected to city $i$.