#include<iostream>
#include<cstdio>
#include<bitset>
#define N 100000
#define M 512
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
struct reads
{
    int num,data;
};
int n,m,X[N+1],Y[N+1];
long long ans;
bitset<M+1>B[N+1];
bitset<M+1>S[N+1];
bitset<M+1>dp[N+1];
int main()
{
    n=read(),m=read();
    for (int i=1;i<=m;++i) X[i]=read(),Y[i]=read();
    for (int i=1;i<=m;i+=M)
    {
	for (int j=1;j<=n;++j) S[j].reset(),B[j].reset(),dp[j].reset();
	for (int j=i;j<=min(i+M-1,m);++j) S[X[j]][j-i]=S[Y[j]][j-i]=1;
	for (int j=1;j<=m;++j) dp[X[j]]|=(B[X[j]]&S[Y[j]]),dp[Y[j]]|=(B[Y[j]]&S[X[j]]),B[X[j]]|=S[Y[j]],B[Y[j]]|=S[X[j]];
	for (int j=i+1;j<=m;++j) ans+=(dp[X[j]]&dp[Y[j]]).count();
    }
    printf("%lld\n",ans/3);
    return 0;
}