Links at every node

Problem

A network has n computers and m two-way cables. Print how many cables are plugged into each computer, in order of computer number.

Input: Line 1: n and m, the number of nodes and edges. Then m lines, each with two node numbers a and b for a two-way link. Nodes are numbered 0 to n - 1.
Output: n numbers separated by single spaces: the degree of node 0, node 1, and so on.
Constraints: 1 ≤ n ≤ 100000
0 ≤ m ≤ 200000
No node is linked to itself and no pair is listed twice

Example

Input

Output

2 2 3 1

Try the problem first. Open one hint at a time.

Hint 1

Keep a list of n counters.

Hint 2

Each cable adds one to the counter of both of its ends.

Write your Python code, run it on the examples and submit it to hidden tests.