#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector fri(n, vector(n, false));
  while (m--) {
    int a, b; cin >> a >> b; --a; --b;
    fri[a][b] = fri[b][a] = true;
  }
  int ans = 0;
  REP(i, n) FOR(j, i + 1, n) FOR(k, j + 1, n) {
    bool ok = true;
    if (!fri[i][j]) {
      REP(l, n) ok &= !(fri[i][l] && fri[j][l]);
    }
    if (!fri[j][k]) {
      REP(l, n) ok &= !(fri[j][l] && fri[k][l]);
    }
    if (!fri[k][i]) {
      REP(l, n) ok &= !(fri[k][l] && fri[i][l]);
    }
    ans += ok;
  }
  cout << ans << '\n';
  return 0;
}