P13965 [AtCoder] There are N cities and M roads.
普及-
题目描述

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.

<dl> <dt>-----Input-----</dt> <dt>Input is given from Standard Input in the following format:</dt> <dt>N M</dt> <dt>a_1 b_1</dt> <dd>a_M b_M</dd> </dl>

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

-----Sample Input-----
4 3
1 2
2 3
1 4

-----Sample Output-----
2
2
1
1

  • City 1 is connected to the 1-st and 3-rd roads.
  • City 2 is connected to the 1-st and 2-nd roads.
  • City 3 is connected to the 2-nd road.
  • City 4 is connected to the 3-rd road.
输入格式

见题面

输出格式

见题面

样例输入
4 3 1 2 2 3 1 4
样例输出
2 2 1 1