Yet Another Graphic Problem

You're given an directed graph with $N$ nodes, and $M$ edges. On this graph, you need to compute for each node $u$, the number of nodes $v$ that are reachable from it (including itself). ### Input - The first line of input has two integers $N$ and $M$, the number of nodes and edges respectively. - Next $M$ lines describe the edges. Each line has two distinct integers $u$ and $v$ which represents