Monochromatic Triangles SCU - 2090

Monochromatic Triangles SCU - 2090

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int N=1010;
typedef long long ll;
int t,n,m;
ll d[N];
int main()
{
	cin>>t;
	while(t--){
		memset(d,0,sizeof d);
		cin>>n>>m;
		while(m--){
			int a,b;
			cin>>a>>b;
			d[a]++,d[b]++;
		}
		ll ans=0;
		for(int i=1;i<=n;i++){
			ans+=(n-d[i]-1)*d[i];
		}
		ans/=2;
		ans=(ll)n*(n-1)*(n-2)/6-ans;
		cout<<ans<<endl;
	}
	return 0;
}