#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

vector<int>e[55];

int main() {
	int n, m;
	cin >> n >> m;

	rep(i, 0, m) {
		int u, v;
		cin >> u >> v;
		e[u].pb(v);
		e[v].pb(u);
	}

	vector<int>c(n);
	rep(i, 0, n)c[i] = i;
	
	int ans = 0;
	rep(i, 0, n)rep(j, i + 1, n)rep(k, j + 1, n)rep(l, k + 1, n) {
		int cnt1 = 0;
		fore(x, e[i]) {
			if (x == j || x == k || x == l)cnt1++;
		}
		int cnt2 = 0;
		fore(x, e[j]) {
			if (x == k || x == l || x == i)cnt2++;
		}
		int cnt3 = 0;
		fore(x, e[k]) {
			if (x == l || x == i || x == j)cnt3++;
		}
		int cnt4 = 0;
		fore(x, e[l]) {
			if (x == i || x == j || x == k)cnt4++;
		}
		if ((cnt1 == 2) && (cnt2 == 2) && (cnt3 == 2) && (cnt4 == 2))ans++;
	}
	cout << ans << endl;

	return 0;
}