#include <cstdio>
#include <vector>
#include <algorithm>
#define f first
#define s second
#include<bitset>
using namespace std;
const int N = 5000;
int n, m, NR;
pair<int ,int> v[67000];
bitset <N> a[N], k;

int main() {
	freopen("triplete.in", "r", stdin);
	freopen("triplete.out", "w", stdout);
	int aux, i, x, y;
	scanf("%d %d", &n, &m);
	for(i = 1; i <= m; ++i) 
		scanf("%d %d", &x, &y), v[i].f = x , v[i].s = y,  a[x][y] = 1, a[y][x] = 1;
	
	for(i = 1; i <= m; ++i) {
		k = a[v[i].f] & a[v[i].s];
		NR += k.count();
	}
	printf("%d\n", NR/3);
	return 0;
}