e-olymp
Competitions

Graph Representation

Degrees of vertices by a list of edges

Undirected graph is given with a list of edges. Find the degrees of all its vertices.

Input

The first line contains the number of vertices in a graph n (1n100) and the number of edges m (1mn (n - 1) / 2). The given m pairs of integers - the edges of the graph.

Output

Print n numbers - the degrees of graph vertices.

Time limit 1 second
Memory limit 128 MiB
Input example #1
4 4
1 2
1 3
2 3
3 4
Output example #1
2
2
3
1