#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int N, M;
int g[51][51];

int main()
{
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		int a, b;
		cin >> a >> b;
		g[a][b] = g[b][a] = 1;
	}

	int ans = 0;
	for (int i = 0; i < N; i++) {
		for (int j = i + 1; j < N; j++) {
			for (int k = j + 1; k < N; k++) {
				for (int l = k + 1; l < N; l++) {
					int d1 = g[i][j] + g[i][k] + g[i][l];
					int d2 = g[j][i] + g[j][k] + g[j][l];
					int d3 = g[k][i] + g[k][j] + g[k][l];
					int d4 = g[l][i] + g[l][j] + g[l][k];
					if (d1 == 2 && d2 == 2 && d3 == 2 && d4 == 2)ans++;
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}