#include<fstream>
#include<vector>
#include<algorithm>
#include<bitset>
using namespace std;

void solve();

unsigned int N, M, rez;
bitset<4100> a[4100];
pair<unsigned int, unsigned int> m[70005];

int main()
{
	solve();
	return 0;
}

void solve()
{
	ifstream fin("triplete.in");
	ofstream fout("triplete.out");
	
	fin >> N >> M;
	for(unsigned int i = 1; i <= M; ++i)
	{
		fin >> m[i].first >> m[i].second;
		
		if( m[i].first > m[i].second) swap( m[i].first, m[i].second);
		a[ m[i].first ][ m[i].second] = 1;
	}
	
	for(unsigned int i = 1; i <= M; ++i)
		rez += (a[ m[i].first ] & a[ m[i].second ] ).count();

	fout << rez;
	fin.close();
	fout.close();
}