#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<queue>

 #define ll long long

 #define M 100010

 using namespace std;

 struct point{

     int to,next;

 }e[M<<];

 int n,m,num;

 int head[M],vis[M];

 ll ans;

 void add(int from,int to)

 {

     e[++num].next=head[from];

     e[num].to=to;

     head[from]=num;

 }

 void bfs(int x)

 {

     memset(vis,,sizeof(vis));

     queue<int>q;

     for(int i=head[x];i;i=e[i].next) q.push(e[i].to);

     while(!q.empty())

     {

         int p=q.front(); q.pop();

         for(int i=head[p];i;i=e[i].next)

         {

             int to=e[i].to;

             if(to!=x) vis[to]++;

         }

     }

     for(int i=;i<=n;i++) ans+=(ll)(vis[i]-)*vis[i]/;

 }

 int main()

 {

     scanf("%d%d",&n,&m);

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

     {

         int x,y; scanf("%d%d",&x,&y);

         add(x,y);

     }

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

     printf("%lld",ans);

     return ;

 }