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 OCaml (4.02.3) (judge verdict: Wrong Answer)

open Batteries
module Mymap = Map.Make(Int)
let () =
  let n = Scanf.scanf "%d " (fun a -> a) in
  let m = Scanf.scanf "%d " (fun a -> a) in
  let pair_lst = Array.to_list @@ Array.init m (fun _ -> Scanf.scanf "%d %d " (fun a b -> a,b)) in

  let amap = List.fold_left (fun accum (x,y) -> 
      Mymap.modify_opt x (fun v_opt -> match v_opt with
            Some v -> Some (v + 1)
          | None -> Some 1
        ) accum |>
      Mymap.modify_opt y (fun v_opt -> match v_opt with
            Some v -> Some (v + 1)
          | None -> Some 1
        ) 
    ) (Mymap.empty) pair_lst
  in

  let pair_lst = Mymap.bindings amap in
  let pair_lst = List.sort compare pair_lst in
  List.iter (fun (x,y) -> Printf.printf "%d\n" y) pair_lst