#include <cstdio>
#include <vector>
using namespace std;
int read(){
	char c=getchar();int x=0;
	while(c<48||c>57) c=getchar();
	do x=x*10+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
const int N=100003;
typedef long long ll;
typedef __int128 lll;
int n,m;lll res;
void write(lll x){if(x>9) write(x/10);putchar((x%10)^48);}
lll C4(int x){return (lll)x*(x-1)*(x-2)*(x-3)/24;}
lll C3(int x){return (lll)x*(x-1)*(x-2)/6;}
lll C2(int x){return (lll)x*(x-1)>>1;}
int eu[N],ev[N],d[N];
vector<int> adj[N],vec[N],ec[N];
int vis[N],ps[N];
inline bool cmp(int x,int y){
	if(d[x]!=d[y]) return d[x]>d[y];
	return x<y;
}
int main(){
	n=read();m=read();
	for(int i=1;i<=m;++i){
		eu[i]=read();ev[i]=read();
		adj[eu[i]].emplace_back(ev[i]);
		adj[ev[i]].emplace_back(eu[i]);
	}
	for(int i=1;i<=n;++i) d[i]=adj[i].size();
	for(int i=1;i<=m;++i)
		if(cmp(eu[i],ev[i])) vec[eu[i]].emplace_back(ev[i]);
		else vec[ev[i]].emplace_back(eu[i]);
	for(int i=1;i<=n;++i) ec[i].resize(vec[i].size());
	res=C4(n)-m*C2(n-2);
	lll tmp=0;
	for(int i=1;i<=m;++i){
		int w=d[eu[i]]+d[ev[i]]-2;
		tmp+=(lll)w*(n-4);
		res-=(lll)(d[eu[i]]-1)*(d[ev[i]]-1);
	}
	res+=C2(m)+(tmp>>1);
	for(int x=1;x<=n;++x){
		res-=C3(d[x]);
		int id=0;
		for(int y:vec[x]) vis[y]=x,ps[y]=id++;
		id=0;
		for(int y:vec[x]){
			int nid=0;
			for(int z:vec[y]){
				if(vis[z]==x){
					res+=d[x]+d[y]+d[z]-n;
					res-=ec[x][id]++;
					res-=ec[x][ps[z]]++;
					res-=ec[y][nid]++;
				}
				++nid;
			}
			++id;
		}
	}
	for(int x=1;x<=n;++x){
		for(int y:vec[x])
			for(int z:adj[y]) vis[z]=0;
		for(int y:vec[x])
			for(int z:adj[y])
				if(cmp(x,z)) res+=vis[z]++;
	}
	if(res<0) res=-res;
	write(res);putchar('\n');
	return 0;
}