#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const char IN[] = {"triplete.in"};
const char OUT[] = {"triplete.out"};
const int INF = 1000000005;
const double PI  = 3.14159265;
const int NMAX = 4100;

#define II inline
#define LL long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fs first
#define ss second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) 	for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) 	for(int i = a ; i >= b ; i--)
#define FORIT(it, V) 	for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
#define all(a) a, a + 

int N, M;
bitset<NMAX> b[NMAX];
PII m[NMAX];
bitset<NMAX> si;
int REZ;

void citi()
{
	scanf("%d%d", &N, &M);
	FOR(i, 1, M)
	{
		scanf("%d%d", &m[i].fs, &m[i].ss);
		//m[i].fs--;m[i].ss--;
		b[m[i].fs][m[i].ss] = 1;
		b[m[i].ss][m[i].fs] = 1;
	}
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);	
	FOR(i, 0, NMAX - 1)	b[i].reset();
	citi();
	FOR(i, 1, M)
		REZ += (b[m[i].fs] & b[m[i].ss]).count();
	printf("%d\n", REZ / 3);
	return 0;
}