#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<vector<int>> g(n,vector<int>(n));
    for(int i = 0;i<m;i++){
        int u,v;
        cin>>u>>v;
        ///u--;v--;
        g[u][v] = g[v][u] = 1;
    }
    ll ans = 0;
    for(int i = 0;i<n;i++){
        for(int j = i + 1;j<n;j++){
            for(int k = j + 1;k<n;k++){
                for(int l = k + 1;l<n;l++){
                    vector<int> id = {i,j,k,l};
                    sort(id.begin(),id.end());
                    bool fn = false;
                    do{
                        if(g[id[0]][id[1]]==1&&g[id[1]][id[2]]==1&&g[id[2]][id[3]]==1&&g[id[3]][id[0]]==1&&g[id[0]][id[2]]==0&&g[id[1]][id[3]]==0) fn = true;
                    }while(next_permutation(id.begin(),id.end()));
                    if(fn) ans++;
                }
            }
        }
    }
    cout<<ans<<endl;
}