Traffic lights-1
Problem
In the dungeon of M tunnels and N junctions, each tunnel connects some two junctions. The mouse king decided to put a traffic light in each tunnel in front of each intersection. Write a program that will calculate how many traffic lights should be installed at each of the intersections. Crossroads are numbered from 1 to N.
Input
The first line contains two numbers N and M (\(0<N<=100\), \(0<=M<=N*(N-1)/2\) ). The following M lines contain two numbers i and j (\(1<=i,j<=N\)) , which means that the intersections i and j are connected by a tunnel.
Imprint
Print N numbers: kth number means the number of traffic lights at the kth intersection.
Note
We can assume that any two intersections are connected by no more than one tunnel. There are no tunnels from the i intersection to itself.
Examples
| # |
Input |
Output |
| 1 |
7 10
5 1
3 2
7 1
5 2
7 4
6 5
6 4
7 5
2 1
5 3
|
3 3 2 2 5 2 3 |