#include <bits/stdc++.h>

using namespace std;

ofstream fout("triplete.out");

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
const int nmax = 4100, mmax = 66000, b = 30;
int n, m, mat[nmax][200];
pair <int, int> edge[mmax];

int main(){
    InParser fin("triplet.in");
    fin >> n >> m;
    for (int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        edge[i] = {x, y};
        mat[x][(y - 1) / b] |= (1 << ((y - 1) % b));
        mat[y][(x - 1) / b] |= (1 << ((x - 1) % b));
    }
    long long answer = 0;
    for (int i = 1; i <= m; ++i){
        int x = edge[i].first, y = edge[i].second;
        for (int j = 0; j <= n / b + 1; ++j){
            int value = mat[x][j] & mat[y][j];
            answer = 1LL * answer + __builtin_popcount(value);
        }
    }
    fout << answer / 3 << "\n";
    fout.close();
    return 0;
}