#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5 + 10;
int n,m;
struct edge
{
    int v,x;
};
struct edge2
{
    int x,y;
}ed[maxn << 1];
int in[maxn];
vector<edge> g[maxn],big[maxn],small[maxn];//大点，小点，定义参上
int ans[10];
int mark[maxn],id[maxn];
int deg[maxn];
int vis[maxn];
int a[maxn];
int cnt;
int c[10] = {1,-1,1,1,-1,-1,-1,1,1,-1};
signed main()
{
    cin >> n >> m;
    for(int i = 1;i <= m;i++)
    {
        int u,v;
        cin >> u >> v;
        ed[i] = {u,v};
        g[u].push_back({v,i});
        g[v].push_back({u,i});
        in[u]++;
        in[v]++;
    }
    ans[0] = (__int128)n * (n - 1) / 2 * (n - 2) / 3 * (n - 3) / 4;//全部状况
    for(int i = 1;i <= n;i++)
    {
        for(int j = 0;j < g[i].size();j++)
        {
            if(in[i] > in[g[i][j].v] || (in[i] == in[g[i][j].v] && i > g[i][j].v))
            {
                big[i].push_back(g[i][j]);
            }
        }
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j = 0;j < g[i].size();j++)
        {
            if(in[i] < in[g[i][j].v] || (in[i] == in[g[i][j].v] && i < g[i][j].v))
            {
                small[i].push_back(g[i][j]);
            }
        }
    }
    ans[1] = m * (n - 2) * (n - 3) / 2;
    for(int i = 1;i <= m;i++)
    {
        ans[2] += m - (in[ed[i].x] + in[ed[i].y] - 1);
    }
    ans[2] /= 2;
    for(int i = 1;i <= n;i++)
    {
        ans[3] += in[i] * (in[i] - 1) / 2 * (n - 3);
    }
    int cur = 0;
    for(int i = 1;i <= m;i++)
    {
        int x = ed[i].x,y = ed[i].y;
        ans[4] += (in[x] - 1) * (in[y] - 1);
    }
    for(int i = 1;i <= n;i++)
    {
        for(edge e : big[i])
        {
            mark[e.v] = 1;
            id[e.v] = e.x;
        }
        for(edge e : big[i])
        {
            for(edge v : big[e.v])
            {
                if(mark[v.v])
                {
                    cur++;
                    ans[7] += in[i] + in[e.v] + in[v.v] - 6;
                    deg[id[v.v]]++;
                    deg[e.x]++;
                    deg[v.x]++;
                }
            }
        }
        for(edge e : big[i])
        {
            mark[e.v] = 0;
        }
    }
    ans[4] -= cur * 3;
    ans[5] += cur * (n - 3);
    for(int i = 1;i <= n;i++)
    {
        ans[6] += in[i] * (in[i] - 1) / 2 * (in[i] - 2) / 3;
    }
    for(int i = 1;i <= m;i++)
    {
        ans[9] += deg[i] * (deg[i] - 1) / 2;
    }
    int del = 0;
    for(int i = 1;i <= n;i++)
    {
        int cnt = 0;
        for(edge e : big[i])
        {
            for(edge v : g[e.v])
            {
                if(v.v != i)
                {
                    if(!vis[v.v])
                    {
                        a[++cnt] = v.v;
                    }
                    vis[v.v]++;
                }
            }
        }
        for(int j = 1;j <= cnt;j++)
        {
            ans[8] += vis[a[j]] * (vis[a[j]] - 1) / 2;
            vis[a[j]] = 0;
        }
    }
    for(int i = 1;i <= n;i++)
    {
        int cnt = 0;
        for(edge e : big[i])
        {
            for(edge v : small[e.v])
            {
                if(v.v != i)
                {
                    if(!vis[v.v])
                    {
                        a[++cnt] = v.v;
                    }
                    vis[v.v]++;
                }
            }
        }
        for(int j = 1;j <= cnt;j++)
        {
            del += vis[a[j]] * (vis[a[j]] - 1) / 2;
            vis[a[j]] = 0;
        }
    }
    ans[8] -= del / 2;
    int res = 0;
    for(int i = 0;i <= 9;i++){res += c[i] * ans[i];if(n == 633 && m != 0)cout << ans[i] << "\n";};
    cout << abs(res);
    return 0;
}