#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
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 FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n, m;
    cin >> n >> m;
    VVI e(n, VI(n));
    while (m--){
        int a, b;
        cin >> a >> b;
        e[a][b] = 1;
        e[b][a] = 1;
    }
    int ans = 0;
    REP(i,n) REP(j,n) REP(k,n) REP(l,n){
        if (i == k || j == l) continue;
        if (e[i][j] & e[j][k] & e[k][l] & e[l][i]){
            if (!e[i][k] & !e[j][l]){
                ans++;
            }
        }
    }
    cout << ans / 8 << endl;


    return 0;
}