#include<fstream>
#include<set>
#include<algorithm>
#include<bitset>

#define NMAX 4100

using namespace std;

ifstream fin("triplete.in");
ofstream fout("triplete.out");

set<short> G[NMAX];
set<short>::iterator its,itp1,itp2;
short n,m;
int sol;
bitset<NMAX> edges[NMAX];

void read()
{
	fin>>n>>m;
	for(int x,y;m;m--)
	{
		fin>>x>>y;
		G[x].insert(y);
		G[y].insert(x);
		edges[x][y]=edges[y][x]=1;
	}
}

void cycle(short nod)
{
	its=G[nod].upper_bound(nod);
	for(itp1=its;itp1!=G[nod].end();++itp1)
	{
		its=G[*itp1].upper_bound(*itp1);
		for(itp2=its;itp2!=G[*itp1].end();++itp2)
			sol+=edges[nod][*itp2];
	}
}

int main()
{
	read();
	for(int i=1;i<=n;i++)
		cycle(i);
	fout<<sol;
	return 0;
}