#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

const int MAX = 55;
int N, M;
PII p[MAX];
map<int, int> mp;

int main(void) {
    scanf("%d%d", &N, &M);
    REP(i, M) {
        int a, b;
        scanf("%d%d", &a, &b);
        p[i] = MP(a, b);
    }
    int ans = 0;
    REP(i, N) FOR(j, i + 1, N) FOR(k, j + 1, N) FOR(l, k + 1, N) {
        VI v{i, j, k, l};
        REP(c, 4) mp[v[c]] = c;
        VI vcnt(4, 0);
        int CNT = 0;
        REP(c, M) {
            if (mp.count(p[c].first) && mp.count(p[c].second)) {
                vcnt[mp[p[c].first]]++;
                vcnt[mp[p[c].second]]++;
                CNT++;
            }
        }
        bool ng = false;
        REP(c, 4) if (vcnt[c] != 2) {
            ng = true;
        }
        if (CNT == 4 && !ng) {
            //FORE(e, v) cout << e << " ";cout << endl;
        }
        ans += CNT == 4 && !ng;
        mp.clear();
    }
    cout << ans << endl;
}