#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define p(s) cout<<(s)<<endl
using namespace std;

bool edge[51][51];
int main(void){
	int N,M;
	cin>>N>>M;
	REP(i,0,M){
		int a,b;
		cin>>a>>b;
		edge[a][b]=edge[b][a]=true;
	}
	int ans=0;
	REP(i,0,N-3){
		REP(j,i+1,N-2){
			REP(k,j+1,N-1){
				REP(l,k+1,N){
					int a=edge[i][j]+edge[i][k]+edge[i][l];
					int b=edge[j][i]+edge[j][k]+edge[j][l];
					int c=edge[k][i]+edge[k][j]+edge[k][l];
					int d=edge[l][i]+edge[l][j]+edge[l][k];
					if(a==2 && b==2 && c==2 && d==2) ans++;
				}
			}
		}
	}
	p(ans);
    return 0;
}