#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, M;
	cin >> N >> M;
	vector tomo(N, vector(N, false)), good(N, vector(N, false));
	REP(i, M) {
		int a, b;
		scanf("%d %d", &a, &b);
		--a; --b;
		tomo[a][b] = tomo[b][a] = true;
		good[a][b] = good[b][a] = true;
	}
	REP(i, N) FOR(j, i + 1, N) {
		if (good[i][j]) continue;
		bool ok = true;
		REP(k, N) ok &= !(tomo[i][k] && tomo[k][j]);
		good[i][j] = good[j][i] = ok;
	}
	int ans = 0;
	REP(i, N) FOR(j, i + 1, N) FOR(k, j + 1, N) ans += good[i][j] && good[i][k] && good[j][k];
	cout << ans << endl;
}