Problem:
Score : 200 points

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.

Sample Input 1

4 3
1 2
2 3
1 4

Sample Output 1

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.

Sample Input 2

2 5
1 2
2 1
1 2
2 1
1 2

Sample Output 2

5
5

Sample Input 3

8 8
1 2
3 4
1 5
2 8
3 7
5 2
4 1
6 8

Sample Output 3

3
3
2
2
2
1
1
2

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

function Main(input){
  var arr = input.split('\n');
  var NM = arr.shift().split(' ');
  var N = Number(NM[0]);
  var M = Number(NM[1]);
  arr.pop();
  arr.sort();

  var a = [];
  for(var i=0;i<arr.length;i++){
    if(isNaN(a[Number(arr[i].split(' ')[1])-1])){
      a[Number(arr[i].split(' ')[1])-1]=0;
    }
    if(isNaN(a[Number(arr[i].split(' ')[0])-1])){
      a[Number(arr[i].split(' ')[0])-1]=0;
    }
    ++a[Number(arr[i].split(' ')[0])-1];
    ++a[Number(arr[i].split(' ')[1])-1];
  }

  for(var i of a){
    if(isNaN(i)){
      console.log(0);
    }else{
      console.log(i);
    }
  }
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));