#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-9;
const int inf=1e8;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
	int n,m;
	cin>>n>>m;
	int cost[60][60]={0};
	rep(i,m){
		int a,b;
		cin>>a>>b;
		cost[a][b]=cost[b][a]=1;
	}
	int out=0;
	rep(x,n)loop(y,x+1,n)loop(z,y+1,n)loop(q,z+1,n){
		vp in;
		if(cost[x][y]==0)in.pb(pii(x,y));
		if(cost[x][z]==0)in.pb(pii(x,z));
		if(cost[x][q]==0)in.pb(pii(x,q));
		if(cost[y][z]==0)in.pb(pii(y,z));
		if(cost[y][q]==0)in.pb(pii(y,q));
		if(cost[z][q]==0)in.pb(pii(z,q));
		if(in.size()==2){
			if(cost[in[0].first][in[1].first]==0)continue;
			if(cost[in[0].first][in[1].second]==0)continue;
			if(cost[in[1].first][in[0].second]==0)continue;
			if(cost[in[1].second][in[0].second]==0)continue;
			out++;
		}
	}
	cout<<out<<endl;
}