We have a grid with $N$ rows and $N$ columns. The cell at the $i$\-th row and $j$\-th column is denoted ($i$, $j$).
Initially, $M$ of the cells are painted black, and all other cells are white. Specifically, the cells ($a_1$, $b_1$), ($a_2$, $b_2$), $...$, ($a_M$, $b_M$) are painted black.
Snuke will try to paint as many white cells black as possible, according to the following rule:
* If two cells ($x$, $y$) and ($y$, $z$) are both black and a cell ($z$, $x$) is white for integers $1≤x,y,z≤N$, paint the cell ($z$, $x$) black.
Find the number of black cells when no more white cells can be painted black.
## Constraints
* $1≤N≤10^5$
* $1≤M≤10^5$
* $1≤a_i,b_i≤N$
* All pairs ($a_i$, $b_i$) are distinct.
## Input
The input is given from Standard Input in the following format:
$N$ $M$
$a_1$ $b_1$
$a_2$ $b_2$
$:$
$a_M$ $b_M$
[samples]