Counting Friends

The friendships among the $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 relation where $A$ and $B$ are the same student is never given.

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

Each of the next $M$ lines contains one friendship as $A$ $B$, the numbers of two students who are friends ($1 \le A, B \le N$, $A \ne B$).

No friendship is given twice. If $A$ $B$ is given, then neither $B$ $A$ nor $A$ $B$ is given again.

Print $N$ lines. The $i$-th line contains the number of friends of student $i$, for $i$ from 1 to $N$.