#include<bits/stdc++.h>
#define ll long long
using namespace std;
int cnt,fst[200005],nxt[200005],to[200005],w[200005];
int n,m,col[200005],sum[3],res,snd;
ll ans;
bool vis[200005],fg;
void AddEdge(int u,int v,int c)
{
	to[++cnt]=v;
	nxt[cnt]=fst[u];
	fst[u]=cnt;
	w[cnt]=c;
}
int Calc(int x)
{
	return x>=3?x-3:(x<0?x+3:x);
}
void Dfs(int u)
{
	snd++;
	sum[col[u]]++;
	vis[u]=1;
	for(int i=fst[u];i;i=nxt[i])
	{
		int v=to[i];
		if(w[i]==1) res++;
		if(!vis[v])
		{
			col[v]=Calc(col[u]+w[i]);
			Dfs(v);
		}
		else if(col[v]!=Calc(col[u]+w[i])) fg=0;
	}
}
int main()
{
	scanf("%d %d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		AddEdge(x,y,1);
		AddEdge(y,x,-1);
	}
	for(int i=1;i<=n;i++)
	{
		if(vis[i]) continue;
		memset(sum,0,sizeof(sum));
		res=snd=0;
		fg=1;
		Dfs(i);
		if(!fg) ans+=1ll*snd*snd;
		else if(sum[0] && sum[1] && sum[2]) ans+=1ll*sum[0]*sum[1]+1ll*sum[0]*sum[2]+1ll*sum[1]*sum[2];
		else ans+=1ll*res;
	}
	printf("%lld\n",ans);
	return 0;
}