#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <codecvt>
#include <locale>
using namespace std;
using ll = long long;

int main() {
    int N, M;
    cin >> N >> M;
    vector<vector<int>> g(N, vector<int>(N));
    for(int i=0; i<M; ++i) {
        int a, b;
        cin >> a >> b;
        g[a][b] = g[b][a] = 1;
    }
    int res = 0;
    for(int i=0; i<N; ++i) {
        for(int j=0; j<N; ++j) {
            for(int k=0; k<N; ++k) {
                for(int l=0; l<N; ++l) {
                    if(i == j || i == k || i == l || j == k || j == l || k == l) {
                        continue;
                    }
                    if(g[i][j] && g[j][k] && g[k][l] && g[l][i] && g[i][k] != 1 && g[j][l] != 1) {
                        res++;
                    }
                }
            }
        }
    }
    res /= 8;
    cout << res << endl;
}