#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#include<queue>
#include<functional>
#include<numeric>
#include<sstream>
#include<math.h>
#include <iomanip>
#define ll long long
#define PLL pair<ll,ll>
#define VS vector<string>
#define VL vector<ll>
#define VB vector<bool>
#define VPLL vector<pair<ll,ll> >
#define VVL vector<vector<ll> >
#define VVVL vector<vector<vector<ll> > >
#define VVB vector<vector<bool> >
#define rep(i,a) for (ll i=0;i<a;i++)
#define nrep(i,n,a) for (ll i=n;i<a;i++)
#define mrep(i,a) for(ll i=a;i>=0;i--)
#define INF 1000000000000000000
#define PI 3.141592653589793238
#define vmin(vec) *std::min_element(vec.begin(),vec.end())
#define vmax(vec) *std::max_element(vec.begin(),vec.end())
#define vsum(vec) std::accumulate(vec.begin(),vec.end(),0LL)
#define ksort(vec) sort(vec.begin(), vec.end(), greater<ll>())
#define ssort(vec) (vec.begin(),vec.end())
#define VPLLsort(vec) sort(vec.begin(), vec.end(),[](PLL &a, PLL &b){ return a.first < b.first; });
#define LTS(n) to_string(n)
#define STL(str) stoll(str)
using namespace std;


int main() {
	ll n, m, a, b, ans = 0;
	cin >> n >> m;
	VVL tree(n, VL(n, 0));
	rep(i, m){
		cin >> a >> b;
		tree[a][b] = 1;
		tree[b][a] = 1;
	}rep(i, n) nrep(j,i+1, n) nrep(k,j+1, n) nrep(l,k+1 ,n){
		if (tree[i][j]+tree[i][k]+tree[i][l]==2 && tree[j][i]+tree[j][k]+tree[j][l]==2 && tree[k][i]+tree[k][j]+tree[k][l]==2 && tree[l][i]+tree[l][j]+tree[l][k]==2){
			ans++;
			//cout << i<<" " << j << " " << k << " " << l << endl;
		}
	}cout << ans << endl;
}