#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, m;
    cin >> n >> m;
    vector<vector<ll>> g(n, vector<ll>(n, 0));
    rep(i, m) {
        ll a, b;
        cin >> a >> b;
        g[a][b] = g[b][a] = 1;
    }
    ll ans = 0;
    rep(a, n) {
        reps(b, a + 1, n) {
            reps(c, b + 1, n) {
                reps(d, c + 1, n) {
                    ll d1 = g[a][b] + g[a][c] + g[a][d];
                    ll d2 = g[b][a] + g[b][c] + g[b][d];
                    ll d3 = g[c][a] + g[c][b] + g[c][d];
                    ll d4 = g[d][a] + g[d][b] + g[d][c];
                    if ((d1 == 2) && (d2 == 2) && (d3 == 2) && (d4 == 2)) {
                        ans++;
                    }
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}