#include<bits/stdc++.h>
#define N 100010
#define ull unsigned long long
#define pc __builtin_popcountll
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define Down(i,a,b) for(register int i=a;i>=b;i--)
using namespace std;
int n,m,d[N],a[N],occ[N],rnk[N];
int mn[N],id[N],rev[N],sta[N],top;
long long tot,ans;
bool mark[N];
mt19937 rnd(time(0));
vector<int> go[N],big[N],small[N],h[N];
struct E{int x,y;}edge[N<<1],nw[N<<2];
struct my_bitset
{
    int sz;ull v[10];
    inline void ins(int x){v[x/64]|=1ull<<(x%64);}
    inline void init(int nsz)
    {
        sz=(nsz-1)/64;
        For(i,0,sz) v[i]=0;
    }
    inline int cnt()
    {
        int res=0;
        For(i,0,sz) res+=pc(v[i]);
        return res;
    }
    inline my_bitset operator &(const my_bitset &p)const
    {
        my_bitset res;res.sz=sz;
        For(i,0,sz) res.v[i]=v[i]&p.v[i];
        return res;
    }
}bs[1010];//手写bitset

struct my_big_bitset
{
    int sz;ull v[2010];
    inline void ins(int x){v[x/64]|=1ull<<(x%64);}
    inline void del(int x){v[x/64]^=1ull<<(x%64);}
    inline void init(int nsz)
    {
        sz=(nsz-1)/64;
        For(i,0,sz) v[i]=0;
    }
    inline int cnt()
    {
        int res=0;
        For(i,0,sz) res+=pc(v[i]);
        return res;
    }
    inline my_big_bitset operator &(const my_big_bitset &p)const
    {
        my_big_bitset res;res.sz=sz;
        For(i,0,sz) res.v[i]=v[i]&p.v[i];
        return res;
    }
}bbs[10010];//手写bitset

inline int read()
{
    register int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x;
}

inline long long C(int n,int m)
{
    if(n < m) return 0;
    if(m > 3)
    {
        __int128 res=1;
        For(i,1,m) res*=n-i+1;
        For(i,1,m) res/=i;
        return res;
    }long long res=1;
    For(i,1,m) res*=n-i+1;
    For(i,1,m) res/=i;
    return res;
}

inline long long solve1()
{
    long long res=1ll*m*C(n-2,2);
    //printf("%d: %lld\n",1,res);
    return res;
}

inline long long solve2()
{
    long long res=0;
    For(i,1,m)
    {
        int x=edge[i].x,y=edge[i].y;
        res+=m-(d[x]+d[y]-1);
    }res>>=1;
    //printf("%d: %lld\n",2,res);
    return res;
}

inline long long solve3()
{
    long long res=0;
    For(i,1,n) res+=C(d[i],2)*(n-3);
    //printf("%d: %lld\n",3,res);
    return res;
}

inline void solve457()
{
    long long res4=0,res5=0,res7=0,cir=0;
    For(i,1,m)
    {
        int x=edge[i].x,y=edge[i].y;
        res4+=1ll*(d[x]-1)*(d[y]-1);
    }
    For(i,1,n)
    {
        for(int to:big[i]) mark[to]=true;
        for(int to:big[i]) for(int v:big[to])
            if(mark[v]) cir++,res7+=d[i]+d[to]+d[v]-6;
        for(int to:big[i]) mark[to]=false;
    }res4-=cir*3,res5=cir*(n-3);
    tot-=res4,tot-=res5,tot+=res7;
    //printf("%d: %lld\n%d: %lld\n%d: %lld\n",4,res4,5,res5,7,res7);
    return;
}

inline long long solve6()
{
    long long res=0;
    For(i,1,n) res+=C(d[i],3);
    //printf("%d: %lld\n",6,res);
    return res;
}

inline long long solve8()
{
    long long res=0,del=0;
    For(i,1,n)
    {
        int cnt=0;
        for(int to:big[i])
            for(int v:go[to]) if(v^i)
            {
                if(!occ[v]) a[++cnt]=v;
                occ[v]++;
            }
        For(j,1,cnt) res+=C(occ[a[j]],2),occ[a[j]]=0;
    }
    For(i,1,n)
    {
        int cnt=0;
        for(int to:big[i])
            for(int v:small[to]) if(v^i)
            {
                if(!occ[v]) a[++cnt]=v;
                occ[v]++;
            }
        For(j,1,cnt) del+=C(occ[a[j]],2),occ[a[j]]=0;
    }res-=del>>1;
    //printf("%d: %lld\n",8,res);
    return res;
}

inline long long solve9()
{
    long long res=0;
    For(i,1,n) id[i]=i;
    shuffle(id+1,id+n,rnd);
    For(i,1,n) rev[id[i]]=i;
    For(i,1,m)
    {
        int a=edge[i].x,b=edge[i].y;
        if(id[a] > id[b]) swap(a,b);
        h[id[b]].push_back(id[a]);
    }mn[n+1]=n+1;
    Down(i,n,1)
    {
        mn[i]=mn[i+1];
        for(int x:h[i]) mn[i]=min(mn[i],x);
    }int pos=1;
    For(i,1,n)
    {
        rnk[i]=top?sta[top--]:++rnk[0];
        bbs[rnk[i]].init(n+1);
        for(int to:go[rev[i]]) bbs[rnk[i]].ins(to);
        for(int x:h[i]) res+=C((bbs[rnk[i]]&bbs[x]).cnt(),2);
        while(pos < mn[i+1]) sta[++top]=rnk[pos++];
    }
    //printf("%d: %lld\n",9,res);
    return res;
}

inline long long solve10()
{
    long long res=0;
    memset(rnk,0,sizeof(rnk));
    For(i,1,n)
    {
        int cnt=0,sz=small[i].size();rnk[0]=0;
        for(int to:small[i]) rnk[to]=++rnk[0],bs[rnk[0]].init(sz);
        for(int to:small[i]) for(int v:small[to])
            if(rnk[v]) bs[rnk[to]].ins(rnk[v]-1),nw[++cnt]=(E){to,v};
        For(j,1,cnt)
        {
            int a=nw[j].x,b=nw[j].y;
            res+=(bs[rnk[a]]&bs[rnk[b]]).cnt();
        }for(int to:small[i]) rnk[to]=0;
    }
    //printf("%d: %lld\n",10,res);
    return res;
}

int main()
{
    n=read(),m=read();
    For(i,1,m)
    {
        int x=read(),y=read();
        edge[i]=(E){x,y};
        go[x].push_back(y),d[x]++;
        go[y].push_back(x),d[y]++;
    }tot=C(n,4);
    For(i,1,n) for(int to:go[i])
        if(d[i] > d[to] || d[i] == d[to] && i > to)
            big[i].push_back(to);
    For(i,1,n) for(int to:go[i])
        if(d[i] < d[to] || d[i] == d[to] && i < to)
            small[i].push_back(to);
    tot+=solve1()*(-1),tot+=solve2();
    tot+=solve3(),solve457();
    tot+=solve6()*(-1),tot+=solve8();
    tot+=solve9()*(-1),ans=solve10(),tot+=ans;
    printf("%lld\n",abs(tot-ans));
    return 0;
}
/*
4 6
1 2
2 3
3 4
4 1
1 3
2 4
*/