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>
//magic lines for ordered_set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
int64_t,
null_type,
less<int64_t>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
	fuctions :
 
    order_of_key (k) : Number of items strictly smaller than k .
    find_by_order(k) : K-th element in a set (counting from zero).
 
 
*/
const int64_t mod = 1e9+7;
/*
	

*/
vector<int64_t>fact(1'000'201) , ifact(1'000'201), po2(1'000'002);
int64_t binpow(int64_t base, int64_t ex){
  int64_t ans = 1;
  while(ex){
    if(ex & 1){
      ans *= base;
      ans %= mod;
    } 
    base *= base;
    base %= mod;
    ex >>= 1;
  }
  
  return ans;
}
int64_t modinv(int64_t a){
  return binpow(a,mod-2);
}
void init(){
  fact[0] = 1;
  fact[1] = 1;
  po2[0] = 1;
  for(int64_t i = 2; i <= 1'000'200; ++i){
    fact[i] = fact[i-1] * i;
    fact[i]%= mod;
  } 
  ifact[1'000'200] = modinv(fact[1'000'200]);
  for(int64_t i = 1'000'200-1; i >= 0; --i){
    ifact[i] = ifact[i+1];
    ifact[i] *= (i+1);
    ifact[i]%=mod;
  }
  int k = rand()%10000;
  for(int64_t i = 1; i <= 1'000'000; ++i){
    po2[i] = po2[i-1] * 2LL;
    po2[i] %= mod;
    //assert(po2[i] > 0);
  }
  assert(ifact[0] == 1);
  assert(ifact[k] == modinv(fact[k]));
}
int64_t nCr(int n, int r){
  if(n < r)return 0;
  int64_t ans = fact[n] * ifact[r];
  ans %= mod;
  ans *= ifact[n-r];
  ans %= mod;
  return ans;
}
void solve(int cnum = 0){
   int64_t n,m;
   cin >> n >> m;
   int64_t ans = n * nCr(n-1,2);
   ans/=3;
   vector<int> conto(n);
   cerr << ans << "\n";
   for(int i = 0; i < m; ++i){
      int a,b;
      cin >> a >> b;a--;b--;
      conto[a] ++;
      conto[b] ++;
   }
   int64_t torem = 0;
   for(int i = 0; i < n; ++i){
      int64_t others = (conto[i] * (n - conto[i] - 1));
      //cerr << i << " is connected to "<< conto[i] << " and reduces the value by "<< others <<"\n";
      torem += others;
   }
   torem/=2;
   ans -= torem;
   cout << ans << "\n";   
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(nullptr);
	//cerr << binexpo(10,10)<<":: works\n";
	init();
	int t;
	int i = 1;
	cout << setprecision(15);
	cout << fixed;
	//cout << primes.size() <<"\n";
	for(  t = 1 ; t--; solve(i),++i);
	//cout << endl;
	
	return 0;

}