#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>E[101000], L[101000];
int Num[101000], n, m, chk, C[3], cc;
long long Res;
void DFS(int a){
    int i;
    C[Num[a]]++;
    cc += E[a].size();
    for(i=0;i<E[a].size();i++){
        if(Num[E[a][i]] == -1){
            Num[E[a][i]] = (Num[a] + L[a][i])%3;
            DFS(E[a][i]);
        }
        else{
            if(Num[E[a][i]] != (Num[a] + L[a][i])%3)chk = 1;
        }
    }
}
int main(){
    int i, a, b, j;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)Num[i]=-1;
    while(m--){
        scanf("%d%d",&a,&b);
        E[a].push_back(b);L[a].push_back(1);
        E[b].push_back(a);L[b].push_back(2);
    }
    for(i=1;i<=n;i++){
        if(Num[i] == -1){
            Num[i] = 0;
            chk = 0;
            cc = 0;
            for(j=0;j<3;j++)C[j]=0;
            DFS(i);
            if(chk){
                Res += 1ll * (C[0]+C[1]+C[2])*(C[0]+C[1]+C[2]);
            }
            else{
                if(!C[0]||!C[1]||!C[2])Res += cc/2;
                else Res += 1ll*C[0]*(C[1]+C[2])+1ll*C[1]*C[2];
            }
        }
    }
    printf("%lld\n",Res);
}