#include<iostream>
#include<cstdio>
#include<bitset>
#include<vector>
#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],num[N+1],deg[N+1];
long long ans;
vector<reads>E[N+1];
vector<int>p[N+1];
bitset<M+1>B[N+1];
void add(int x,int y,int z)
{
    E[x].push_back((reads){y,z});
    return;
}
int main()
{
    n=read(),m=read();
    for (int i=1;i<=m;++i) X[i]=read(),Y[i]=read(),deg[X[i]]++,deg[Y[i]]++;
    for (int i=1;i<=m;++i)
    {
	if (deg[X[i]]<deg[Y[i]]) add(X[i],Y[i],i);
	else add(Y[i],X[i],i);
    }
    for (int i=1;i<=n;++i)
    {
	for (int j=0;j<E[i].size();++j) num[E[i][j].num]=E[i][j].data;
	for (int j=0;j<E[i].size();++j)
	    for (int k=0;k<E[E[i][j].num].size();++k)
		if (i!=E[E[i][j].num][k].num&&num[E[E[i][j].num][k].num])
		{
                    p[E[i][j].data].push_back(E[E[i][j].num][k].num);
		    p[E[E[i][j].num][k].data].push_back(i);
		    p[num[E[E[i][j].num][k].num]].push_back(E[i][j].num);
		}
    }
    for (int i=1;i<=m;i+=M)
    {
	for (int j=1;j<=n;++j) B[j].reset();
	for (int j=i;j<=min(i+M-1,m);++j)
	    for (int k=0;k<p[j].size();++k)
		B[p[j][k]][j-i]=1;
	for (int j=1;j<=m;++j) ans+=(B[X[j]]&B[Y[j]]).count();
    }
    printf("%lld\n",ans/6);
    return 0;
}