# include <fstream>
# include <set>
# include <algorithm>
# define DIM 5000
using namespace std;
int n, m, sol;
set<int>G[DIM];

int main ()
{
	ifstream fin ("triplete.in");
	ofstream fout ("triplete.out");
	fin>>n>>m;
	int a, b;
	for(;m--;)
	{
		fin>>a>>b;
		G[a].insert(b);
		G[b].insert(a);
	}
	set<int>::iterator i, j;
	for(int k=1;k<=n;++k)
		for(i=G[k].begin();i!=G[k].end();++i)
			for(j=i;j!=G[k].end();++j)
				if (binary_search(G[*i].begin(), G[*i].end(), *j))
					++sol;
	fout<<sol/3;
	return 0;
}