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

import java.io.*;
import java.math.*;
import java.util.*;


//ESTE PROBLWMA ESTA MUY BONITO
/*
 * Este problema esta super pillo al final es un problema de combinatorio en el cual
 *  no hay que hacer ni BFS ni DFS
 * ni ninguna de las ideas que de antemano se le ocurren a uno solo basta una formula combinatoria 
 * que nos resuelve el problema que solo necesita saber la cantidad de vertices del grafo,
 * la cantidad de aristas y el grado de cada arista
 * 
 * */

public class p142d1C {
    
    StringTokenizer tokenizer;
    BufferedReader reader;
    PrintStream out;
    long n,m;
    long[] degree=new long[1000002];
    
    public void Main () throws Exception
    {
        n=nextInt();
        m=nextInt();
        
        //calculando el grado de cada vertice
        for(int i=0;i<m;i++)
        {
            degree[nextInt()-1]++;
            degree[nextInt()-1]++;
        }
        
        long result=n*(n-1)*(n-2)/6 -(n-2)*m;
        
        for(int i=0;i<n;i++)
        {
            result+= degree[i]*(degree[i]-1)/2;
        }
        out.println(result);
    }    
    /*  The problem's solution finish here.  */
    
    public static void main (String[] args)  throws Exception
    {
        new p142d1C().Run();
    }
    
    public void Run() throws Exception
    {
        Init();
        Main();
    }
    
    
    public void Init()
    {
        try
        {
            reader = new BufferedReader(new InputStreamReader(System.in));
            tokenizer = null;
            out = System.out;           
        }
        catch (Exception e)
        {
            e.printStackTrace();
            System.exit(1);
            //System.exit(0);
        }       
    }   
    
    
    //helpers de lectura
    String next () throws Exception
    {
        while (tokenizer == null || !tokenizer.hasMoreTokens())
            tokenizer = new StringTokenizer(reader.readLine());     
        return tokenizer.nextToken();       
    }
    
    int nextInt () throws Exception{return Integer.parseInt(next());}
    
    long nextLong () throws Exception{return Long.parseLong(next());}
    
    double nextDouble () throws Exception{return Double.parseDouble(next());}

}
