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

//package round141;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class C implements Runnable {

	private int n;
	private int m;
	private int[] black;
	private int[] from;
	private int[] to;
	
	private long lowerBlack;
	private long lowerWhite;
	private long higherBlack;
	private long higherWhite;
	private long singleBlack;
	
	private int numBlack(int idx) {
		return black[idx];
	}
	
	private int numWhite(int idx) {
		return n - 1 - numBlack(idx);
	}
	
	private void calcMagick() {
		for (int i = 0; i < m; i++) {
			lowerBlack += numBlack(from[i]) - 1;
			lowerWhite += numWhite(from[i]);
			higherBlack += numBlack(to[i]) - 1;
			higherWhite += numWhite(to[i]);
			
		}
	}
	
	private long getAnswer() {
		long secondToSeventh = (lowerWhite + higherWhite) / 2;
		return n * (n - 1) * (n - 2) / 6 - secondToSeventh;
	}
	
	private void solve() throws NumberFormatException, IOException {
		n = in.nextInt();
		black = new int[n];
		
		m = in.nextInt();
		this.from = new int[m];
		this.to = new int[m];
		for (int i = 0; i < m; i++) {
			int from = in.nextInt() - 1;
			int to = in.nextInt() - 1;
			
			if (from > to) {
				int tmp = from;
				from = to;
				to = tmp;
			}
			
			this.from[i] = from;
			this.to[i] = to;
			
			black[from]++;
			black[to]++;
		}
		
		calcMagick();
		
		System.out.println(getAnswer());
	}

	private FastScanner in;
	private PrintWriter out;

	@Override
	public void run() {
		in = new FastScanner(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		try {
			solve();
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			out.close();
		}
	}

	private static class FastScanner {
		private final BufferedReader reader;
		private StringTokenizer tokens;

		public FastScanner(Reader rawReader) {
			reader = new BufferedReader(rawReader);
		}

		public boolean hasNext() throws IOException {
			while (tokens == null || !tokens.hasMoreTokens()) {
				String nextLine = reader.readLine();
				if (nextLine == null)
					return false;
				tokens = new StringTokenizer(nextLine);
			}
			return true;
		}

		public String next() throws IOException {
			return hasNext() ? tokens.nextToken() : null;
		}

		public long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}
	}

	public static void main(String[] args) {
		new C().run();
	}

}
