Friend counts

The friendships among $N$ students in Dohyun's class are given. Write a program that prints how many friends each student has.

The students are numbered from $1$ to $N$. If $A$ and $B$ are friends, then $B$ and $A$ are friends too. Nobody is a friend of themselves, so $A$ and $B$ are never equal.

The first line contains the number of students $N$ ($1 \le N \le 1000$) and the number of friendships $M$ ($0 \le M \le 1000$), separated by a space.

Each of the next $M$ lines contains one friendship as $A$ $B$ ($1 \le A, B \le N$, $A \ne B$).

Once $A$ $B$ appears, the same friendship never appears again as $A$ $B$ or as $B$ $A$.

Print $N$ lines. Line $i$ holds the number of friends of student $i$, in order from student $1$ to student $N$.