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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("4 3");
            WillReturn.Add("1 2");
            WillReturn.Add("2 3");
            WillReturn.Add("1 4");
            //2
            //2
            //1
            //1
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("2 5");
            WillReturn.Add("1 2");
            WillReturn.Add("2 1");
            WillReturn.Add("1 2");
            WillReturn.Add("2 1");
            WillReturn.Add("1 2");
            //5
            //5
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("8 8");
            WillReturn.Add("1 2");
            WillReturn.Add("3 4");
            WillReturn.Add("1 5");
            WillReturn.Add("2 8");
            WillReturn.Add("3 7");
            WillReturn.Add("5 2");
            WillReturn.Add("4 1");
            WillReturn.Add("6 8");
            //3
            //3
            //2
            //2
            //2
            //1
            //1
            //2
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();

        int[] wkArr = { };
        Action<string> SplitAct = pStr =>
            wkArr = pStr.Split(' ').Select(X => int.Parse(X)).ToArray();

        SplitAct(InputList[0]);
        int N = wkArr[0];

        int[] EdgeCntArr = new int[N + 1];
        foreach (string EachStr in InputList.Skip(1)) {
            SplitAct(EachStr);

            EdgeCntArr[wkArr[0]]++;
            EdgeCntArr[wkArr[1]]++;
        }

        for (int I = 1; I <= N; I++) {
            Console.WriteLine(EdgeCntArr[I]);
        }
    }
}