#include<fstream>
#include<cstring>
#include<queue>
#include<algorithm>
#include<string.h>
#include<bitset>
#include<ctime>
#include<set>
#include<cmath>
#include<unordered_map>
#include<iomanip>
#include<map>
#include<stack>
#include<vector>
#include<bitset>
#include<functional>
#include<iostream>
#include<deque>
#include<unordered_set>
#include<queue>
#include<list>
#include<array>
#include<ctype.h>
using namespace std;
long long i, j, k, ok, n, m, el, min1, max1, x, y, a, b, rez;
bitset<4100>bit[4100], nr;
int v1[66666], v2[66666];
int main()
{
	ifstream f("triplete.in");
	ofstream g("triplete.out");
	//ifstream f("file.in");
	//ofstream g("file.out");
	f >> n >> m;
	for (i = 1; i <= m; i++)
	{
		f >> v1[i] >> v2[i];
		if(v1[i]>v2[i])
			bit[v2[i]].set(v1[i]);
		else
			bit[v1[i]].set(v2[i]);

	}
	for (i = 1; i <= m; i++)
		{
			nr = (bit[v1[i]] & bit[v2[i]]);
			rez += nr.count();
		}
	g << rez;
	return 0;
}