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


Output

Print the number of black cells when no more white cells can be painted black.

Examples

Input

3 2
1 2
2 3


Output

3


Input

2 2
1 1
1 2


Output

4


Input

4 3
1 2
1 3
4 4


Output

3
#include <cstdio>
#include <vector> 

typedef long long LL;
const int MN = 100005;

int N, M; LL Ans;
std::vector<int> G[MN], iG[MN];

int ok, col[MN], a[3], cv, ce;
void DFS(int u, int c) {
	++a[col[u] = c], ++cv;
	ce += G[u].size();
	for (int v : G[u])
		if (!~col[v]) DFS(v, (c + 1) % 3);
		else if (col[v] != (c + 1) % 3) ok = 0;
	for (int v : iG[u])
		if (!~col[v]) DFS(v, (c + 2) % 3);
		else if (col[v] != (c + 2) % 3) ok = 0;
}

int main() {
	scanf("%d%d", &N, &M);
	while (M--) {
		int x, y;
		scanf("%d%d", &x, &y);
		G[x].push_back(y);
		iG[y].push_back(x);
	}
	for (int i = 1; i <= N; ++i) col[i] = -1;
	for (int i = 1; i <= N; ++i) if (!~col[i]) {
		ok = 1, a[0] = a[1] = a[2] = cv = ce = 0;
		DFS(i, 0);
		if (!ok) Ans += (LL)cv * cv;
		else if (a[0] && a[1] && a[2]) Ans += (LL)a[0] * a[1] + (LL)a[1] * a[2] + (LL)a[2] * a[0];
		else Ans += ce;
	}
	printf("%lld\n", Ans);
	return 0;
}