- Time limit: 1.00 s
- Memory limit: 512 MB
A directed acyclic graph consists of nodes and edges. The nodes are numbered .
Calculate for each node the number of nodes you can reach from that node (including the node itself).
Input
The first input line has two integers and : the number of nodes and edges.
Then there are lines describing the edges. Each line has two distinct integers and : there is an edge from node to node .
Output
Print integers: for each node the number of reachable nodes.
Constraints
Example
Input:
5 6 1 2 1 3 1 4 2 3 3 5 4 5
Output:
5 3 2 2 1