Traffic lights#993
There are tunnels and intersections in the dungeon. Each tunnel connects two intersections. The Rat King decided to install a traffic light in each tunnel before each intersection.
Write a program that determines how many traffic lights need to be installed at each intersection. The intersections are numbered from to .
The first line contains two integers and m~(0 < n \le 100, 0 \le m \le \frac{n \cdot (n - 1)}{2}). Each of the next lines contains two integers and j~(1 \le i, j \le n), indicating that intersections and are connected by a tunnel.
Print integers: the -th integer is the number of traffic lights that need to be installed at the -th intersection.
It is guaranteed that there is at most one tunnel between any two intersections, and there are no tunnels connecting an intersection to itself.
Example 1