#include<fstream>
#include<vector>
#include<algorithm>
#include<bitset>

#define NMAX 4100
#define V1 G[nod][i]
#define V2 G[V1][j]

using namespace std;

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

vector<short> G[NMAX];
vector<short>::iterator it;
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].push_back(y);
		G[y].push_back(x);
		edges[x][y]=edges[y][x]=1;
	}
}

void cycle(short nod)
{
	it=upper_bound(G[nod].begin(),G[nod].end(),nod);
	if(*it<=nod || it==G[nod].end())
		return;
	for(size_t i=(int)(it-G[nod].begin());i<G[nod].size();i++)
	{
		it=upper_bound(G[V1].begin(),G[V1].end(),V1);
		if(*it<=V1 || it==G[V1].end())
			continue;
		for(size_t j=(int)(it-G[V1].begin());j<G[V1].size();j++)
			sol+=edges[nod][V2];
	}
}

int main()
{
	read();
	for(int i=1;i<=n;i++)
		sort(G[i].begin(),G[i].end());
	for(int i=1;i<=n;i++)
		if(!G[i].empty())
			cycle(i);
	fout<<sol;
	return 0;
}