3 3
1 2
3 1
2 3
 2 0
 10 17
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
 2 1
1 2
 8 13
1 2
2 3
3 4
4 1
2 4
1 3
5 6
6 7
7 8
8 5
6 8
5 7
1 8
 3 2
1 2
2 3
 10 9
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
 10 40
1 3
2 6
9 10
4 6
1 2
1 8
6 10
3 6
1 4
5 7
3 8
3 9
4 5
3 7
8 9
5 9
5 6
2 3
3 4
1 6
4 8
3 10
5 10
2 8
2 10
4 7
1 10
1 7
4 10
5 8
8 10
7 9
6 8
2 7
4 9
6 9
7 8
6 7
1 5
2 9
 10 9
1 2
2 3
3 1
4 5
5 6
6 7
7 4
4 6
5 7
 1000000 0
 8 11
1 2
1 3
1 4
2 3
2 7
7 4
4 2
7 5
8 1
1 7
7 8
 9 9
1 2
2 3
3 1
4 5
5 6
6 4
7 8
8 9
9 7
 15 14
1 2
1 3
1 4
1 5
2 6
2 7
7 8
7 9
3 10
10 11
4 12
12 13
13 14
13 15
 10 17
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
 9 12
1 2
2 3
3 1
1 4
4 5
5 1
1 6
6 7
7 1
1 8
8 9
9 1
 3 1
1 2
 10 5
5 7
4 8
9 10
7 10
6 10
 15 15
1 2
1 3
1 4
1 5
2 6
2 7
7 8
7 9
3 10
10 11
4 12
12 13
13 14
13 15
15 1
 4 3
1 2
2 3
3 1
 10 30
4 9
4 6
1 2
8 10
7 8
4 7
1 8
6 7
5 6
1 5
7 9
1 7
8 9
7 10
9 10
3 9
2 7
5 7
5 9
2 8
2 9
5 8
3 10
1 6
3 6
2 10
6 8
3 4
2 5
4 5
 4 3
1 2
1 3
1 4
 4 6
1 2
2 3
3 4
4 1
1 3
2 4
 10 9
1 2
1 3
1 4
2 5
5 6
2 7
3 8
3 9
9 10
 10 10
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 1
 3 0
 6 6
1 2
2 3
3 1
4 5
5 6
6 4
 10 0
 9 15
1 2
2 3
3 1
1 4
4 5
5 1
1 6
6 7
7 1
1 8
8 9
9 1
2 9
7 4
2 8
 4 0
 1 0

1
 0
 43
 0
 8
 0
 84
 82
 63
 166666166667000000
 21
 30
 292
 64
 36
 0
 84
 284
 1
 37
 1
 4
 59
 50
 1
 2
 120
 28
 4
 0

#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(char ch) {
  string s;
  s += ch;
  return s;
}
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const int maxn = 2e4 + 5;
const long long mod = 1e9 + 7;
vector<long long> fac(maxn), invfac(maxn);
long long expmod(long long x, long long n, long long mod) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0) {
    long long temp = expmod(x, n / 2, mod);
    return (temp * temp) % mod;
  } else {
    return (expmod(x, n - 1, mod) * x) % mod;
  }
}
long long modinv(long long x, long long mod) { return expmod(x, mod - 2, mod); }
void find_fac() {
  fac[0] = 1;
  invfac[0] = 1;
  for (int i = 1; i < maxn; i++) {
    fac[i] = fac[i - 1] * i % mod;
    invfac[i] = invfac[i - 1] * modinv(i, mod) % mod;
  }
}
void solve() {
  long long n, m;
  cin >> n >> m;
  vector<long long> deg(n + 1);
  for (int i = (int)0; i < (int)m; i++) {
    int a, b;
    cin >> a >> b;
    deg[a]++;
    deg[b]++;
  }
  long long sub = 0;
  for (int a = (int)1; a < (int)n + 1; a++) {
    sub += deg[a] * (n - 1 - deg[a]);
  }
  sub /= 2;
  long long ans = n * (n - 1) * (n - 2) / 6;
  42;
  ans -= sub;
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int tc = 1; tc <= t; tc++) {
    solve();
  }
}
