// Blackout
// * frank_c1
// * 2017 / 12 / 18
 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int maxn = (int)(1e5) + 5;
vector<int> nxt[maxn], val[maxn];
int vi[maxn], co[maxn];
int M, S;
LL C[3];

void dfs(int x) {
	vi[x] = 1; ++C[co[x]]; 
	for (int i = 0; i < (int)nxt[x].size(); ++i)
		if (!vi[nxt[x][i]]) {
			co[nxt[x][i]] = (co[x] + val[x][i]) % 3;
			M += (val[x][i] == 1); dfs(nxt[x][i]);
		} else {
			M += (val[x][i] == 1);
			if (co[nxt[x][i]] != (co[x] + val[x][i]) % 3) S = 1;
		}
}

int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; ++i) {
		int u, v;
		scanf("%d%d", &u, &v);
		nxt[u].push_back(v); val[u].push_back(1);
		nxt[v].push_back(u); val[v].push_back(2);
	} LL ret = 0;
	for (int i = 1; i <= n; ++i) if (!vi[i]) {
		M = S = 0; memset(C, 0, sizeof(C)); dfs(i);
		if (S) ret += (C[0] + C[1] + C[2]) * (C[0] + C[1] + C[2]);
		else {
			if (!C[0] || !C[1] || !C[2]) ret += M;
			else ret += C[0] * C[1] + C[1] * C[2] + C[2] * C[0];
		}
	}
	return printf("%lld\n", ret), 0;
}