#include<fstream>
#include<cstdio>
#include<bitset>
using namespace std;
int n,m,A[66000],B[66000],sol;
bitset <4100> G[4100],nr;
int main()
{
	int i;
	freopen("triplete.in","r",stdin);
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",A+i,B+i);
		if(A[i]<B[i])
			G[A[i]].set(B[i]);
		else
			G[B[i]].set(A[i]);
	}
	for(i=1;i<=m;i++)
	{
		nr=(G[A[i]]&G[B[i]]);
		sol+=nr.count();
	}
	freopen("triplete.out","w",stdout);
	printf("%d\n",sol);
	return 0;
}