#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

using i128 = __int128;
using pi = pair<int, int>;
using ull = unsigned long long;

IL ostream& operator << (ostream &os, i128 x) {
  static char s[64], *t = s;
  if (x < 0) {
    // os.put('-');
    x = ~(x - 1);
  }
  do {
    *t++ = x % 10 | 48;
    x /= 10;
  } while (x);
  while (t != s) {
    os.put(*--t);
  }
  return os;
}

struct pair_hash {
  ull operator () (const pi &o) const {
    return (ull(o.first) << 32) | o.second;
  }
};


constexpr int N = 1e5 + 9;
constexpr int M = 2e5 + 9;
int n, m, p[N], q[N], d[N];
vi g[N], G[N];

unordered_map<pair<int, int>, int, pair_hash> id;

int cv[N], ce[M], c3, c4, c[N];

IL i128 C (int n, int m) {
  i128 ret = 1;
  L (i, n - m + 1, n) {
    ret *= i;
  }
  L (i, 1, m) {
    ret /= i;
  }
  return ret;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  L (i, 1, m) {
    int u, v;
    cin >> u >> v;
    id[pi(u, v)] = id[pi(v, u)] = i;
    g[u].eb(v);
    g[v].eb(u);
  }
  L (i, 1, n) {
    p[i] = i, d[i] = sz(g[i]);
  }
  sort(p + 1, p + n + 1, [] (int x, int y) {
    return d[x] < d[y];
  });
  L (i, 1, n) {
    q[p[i]] = i;
  }
  L (u, 1, m) {
    for (int v : g[u]) {
      if (q[v] > q[u]) {
        G[u].eb(v);
      }
    }
  }
  L (i, 1, n) {
    int u = p[i];
    for (int v : G[u]) {
      c[v] = 1;
    }
    for (int v : G[u]) {
      for (int w : G[v]) {
        if (c[w]) {
          c3 += 1;
          cv[u] += 1;
          cv[v] += 1;
          cv[w] += 1;
          ce[id[pi(u, v)]] += 1;
          ce[id[pi(v, w)]] += 1;
          ce[id[pi(w, u)]] += 1;
        }
      }
    }
    for (int v : G[u]) {
      c[v] = 0;
    }
  }
  L (i, 1, n) {
    int u = p[i];
    for (int v : G[u]) {
      for (int w : g[v]) {
        if (q[w] > q[u]) {
          c4 += c[w]++;
        }
      }
    }
    for (int v : G[u]) {
      for (int w : g[v]) {
        c[w] = 0;
      }
    }
  }
  i128 f0 = C(n, 4);
  i128 f1 = m * C(n - 2, 2);
  i128 f2 = C(m, 2);
  L (i, 1, n) {
    f2 += (n - 4) * C(d[i], 2);
  }
  i128 f3 = i128(n - 6) * c3;
  L (i, 1, n) {
    f3 += C(d[i], 3);
  }
  L (u, 1, n) {
    for (int v : G[u]) {
      f3 += i128(d[u] - 1) * (d[v] - 1);
    }
  }
  i128 f4 = c4;
  L (i, 1, n) {
    f4 += i128(d[i] - 2) * cv[i];
  }
  i128 f5 = 0;
  L (i, 1, m) {
    f5 += C(ce[i], 2);
  }
  if (n == 633 && m == 100) {
    cout << f0 << ' ' << f1 << ' ' << f2 << ' ' << f3 << ' ' << f4 << ' ' << f5 << ' ' << c4 << ' ' << c3 << '\n';
  }
  cout << f0 - f1 + f2 - f3 + f4 - f5 << '\n';
}
// I love WHQ!