#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if (x < y) x = y; }

int main() {
	int N; int M;
	while (~scanf("%d%d", &N, &M)) {
		bool g[50][50] = {};
		rep(i, M) {
			int A; int B;
			scanf("%d%d", &A, &B);
			g[A][B] = g[B][A] = true;
		}
		int ans = 0;
		rep(i, N) rep(j, i) rep(k, j) rep(l, k) {
			int perm[4] = { i,j,k,l };
			sort(perm, perm + 4);
			do {
				bool ok = true;
				rep(p, 4) {
					ok &= g[perm[p]][perm[(p + 1) % 4]];
					ok &= !g[perm[p]][perm[(p + 2) % 4]];
				}
				ans += ok;
			} while (next_permutation(perm, perm + 4));
		}
		ans /= 8;
		printf("%d\n", ans);
	}
	return 0;
}