#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 200000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int num,data;
};
int n,m,length,p[N+1],rk[N+1],deg[N+1],num[N+1],cnt[N+1],scnt[N+1];
long long res;
__int128 ans;
vector<int>E[N+1];
vector<reads>ES[N+1];
bool cmp(int x,int y)
{
	return deg[x]>deg[y];
}
void solve(int x,int y,int z,int d1,int d2,int d3)
{
	ans+=deg[x]+deg[y]+deg[z]-n,cnt[d1]++,cnt[d2]++,cnt[d3]++;
	return;
}
void write(__int128 x)
{
	if (x<=9)
	{
		printf("%d",(int)(x));
		return;
	}
	write(x/10),printf("%d",(int)(x%10));
	return;
}
int main()
{
	int x,y;
	n=read(),m=read();
	for (int i=1;i<=m;++i) x=read(),y=read(),E[x].push_back(y),E[y].push_back(x),deg[x]++,deg[y]++;
	ans+=(__int128)(n)*(n-1)*(n-2)*(n-3)/24;
	ans-=(__int128)(m)*(n-2)*(n-3)/2;
	for (int i=1;i<=n;++i) ans+=(__int128)(deg[i])*(deg[i]-1)/2*(n-3);
	for (int i=1;i<=n;++i) ans-=(__int128)(deg[i])*(deg[i]-1)*(deg[i]-2)/6;
	for (int i=1;i<=n;++i)
		for (int j=0;j<E[i].size();++j)
			if (i<E[i][j])
				ans-=(__int128)(deg[i]-1)*(deg[E[i][j]]-1),res+=m-deg[i]-deg[E[i][j]]+1;
	ans+=(res>>1);
	for (int i=1;i<=n;++i) p[i]=i;
	sort(p+1,p+n+1,cmp);
	for (int i=1;i<=n;++i) rk[p[i]]=i;
	for (int i=1;i<=n;++i)
		for (int j=0;j<E[i].size();++j)
			if (rk[i]<rk[E[i][j]])
				ES[i].push_back((reads){E[i][j],++length});
	for (int i=1;i<=n;++i)
	{
		for (int j=0;j<ES[i].size();++j) num[ES[i][j].num]=ES[i][j].data;
		for (int j=0;j<ES[i].size();++j)
			for (int k=0;k<ES[ES[i][j].num].size();++k)
				if (num[ES[ES[i][j].num][k].num])
					solve(i,ES[i][j].num,ES[ES[i][j].num][k].num,ES[i][j].data,ES[ES[i][j].num][k].data,num[ES[ES[i][j].num][k].num]);
		for (int j=0;j<ES[i].size();++j) num[ES[i][j].num]=0;
	}
	for (int i=1;i<=length;++i) ans-=(__int128)(cnt[i])*(cnt[i]-1)/2;
	for (int i=1;i<=n;++i)
	{
		for (int j=0;j<ES[i].size();++j)
		{
			for (int k=0;k<E[ES[i][j].num].size();++k)
				if (rk[E[ES[i][j].num][k]]>rk[i])
					ans+=scnt[E[ES[i][j].num][k]];
			for (int k=0;k<E[ES[i][j].num].size();++k)
				if (rk[E[ES[i][j].num][k]]>rk[i])
					scnt[E[ES[i][j].num][k]]++;
		}
		for (int j=0;j<ES[i].size();++j)
			for (int k=0;k<E[ES[i][j].num].size();++k)
				if (rk[E[ES[i][j].num][k]]>rk[i])
					scnt[E[ES[i][j].num][k]]=0;
	}
	write(ans>0?ans:-ans),puts("");
	return 0;
}