#include<iostream>
#include<cstdio>
#include<bitset>
#include<vector>
#include<algorithm>
#define N 100000
#define M 800
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;
}
int n,m,cnt,X[N+1],Y[N+1],num[N+1],deg[N+1],p[N+1],q[N+1];
long long ans;
vector<int>E[N+1];
bitset<M+1>B[N+1];
void add(int x,int y)
{
    E[x].push_back(y);
    return;
}
bool cmp(int x,int y)
{
    return deg[x]<deg[y];
}
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<=n;++i) p[i]=i;
    sort(p+1,p+n+1,cmp);
    for (int i=1;i<=n;++i) q[p[i]]=i;
    for (int i=1;i<=m;++i)
    {
	if (q[X[i]]<q[Y[i]]) add(X[i],Y[i]);
	else add(Y[i],X[i]);
    }
    for (int i=1;i<=n;++i)
    {
	cnt=0;
	for (int j=0;j<E[i].size();++j) num[E[i][j]]=++cnt,B[E[i][j]].reset();
	for (int j=0;j<E[i].size();++j)
	    for (int k=0;k<E[E[i][j]].size();++k)
		if (num[E[E[i][j]][k]])
		    B[E[i][j]][num[E[E[i][j]][k]]]=1;
	for (int j=0;j<E[i].size();++j)
	    for (int k=0;k<E[E[i][j]].size();++k)
		if (num[E[E[i][j]][k]])
		    ans+=(B[E[i][j]]&B[E[E[i][j]][k]]).count();
	for (int j=0;j<E[i].size();++j) num[E[i][j]]=0;
    }
    printf("%lld\n",ans);
    return 0;
}