#include<iostream>

#include<cstdio>

#include<string>

#include<cstring>

#include<algorithm>

using namespace std;

int n,m;

const int maxn=1e4+;

const int maxm=1e5+;

struct edge{

    int to;

    int nxt;

}e[maxm];

int head[maxn];

int tot;

int S[maxn],top;

int dfn[maxn],low[maxn],id;

int belong[maxn],num;

bool vis[maxn];

int circle[maxn];

void init(){

    memset(head,-,sizeof(head));

    tot=;

    id=top=num=;

    memset(dfn,,sizeof(dfn));

    memset(low,,sizeof(low));

    memset(vis,false,sizeof(vis));

    memset(circle,,sizeof(circle));

}

void add(int u,int v){

    e[tot].to=v;

    e[tot].nxt=head[u];

    head[u]=tot++;

}

void tarjan(int u)

{

    dfn[u]=low[u]=++id;

    S[++top]=u;

    vis[u]=true;

    for(int i=head[u];i!=-;i=e[i].nxt)

    {

        int v=e[i].to;

        if(!dfn[v])

        {

            tarjan(v);

            low[u]=min(low[u],low[v]);

        }

        else if(vis[v]) low[u]=min(low[u],dfn[v]);

    }

    if(dfn[u]==low[u])

    {

        num++;

        while()

        {

            belong[S[top]]=num;

            vis[S[top]]=false;

            if(S[top--]==u) break;

        }

    }

}

int main(){

    while(~scanf("%d%d",&n,&m)){

        init();

        int u,v;

        for(int i=;i<=m;i++){

            scanf("%d%d",&u,&v);

            add(u,v);

        }

        for(int i=;i<=n;i++){

            if(!dfn[i]) tarjan(i);

        }

        for(int i=;i<=n;i++){

            circle[belong[i]]++;

        }

        int ans=;

        for(int i=;i<=num;i++){

            ans+=circle[i]*(circle[i]-)/;

        }

        printf("%d\n",ans);

    }

    return ;

}