#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
 
using namespace std;

int n, m;

bool a[4100][4100];

vector<int> g[4100];

int main() {
	freopen("triplete.in", "r", stdin);
	freopen("triplete.out", "w", stdout);

	scanf("%d %d", &n, &m);

	for (int i = 0; i < m; ++i) {
		int x, y;
		scanf("%d %d", &x, &y);
		a[x][y]++;
		a[y][x]++;

		if (x < y) {
			g[x].push_back(y);
		}
	}

	int result = 0;

	for (int i = 1; i <= n; ++i) {

		int common = 0;

		for (auto j : g[i]) {
			for (int k = j + 1; k <= n; ++k) {
				if (a[i][k] && a[j][k]) {
					common++;
				}
			}
		}

		result += common;
	}

	printf("%d", result);

	return 0;
}