#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n,m;
    cin>>n>>m;
    int g[n][n]{};
    for (int i=0;i<m;i++) {
        int a,b;
        cin>>a>>b;
        g[a][b]=g[b][a]=1;
    }
    int 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++) {
                    int a[]={i,j,k,l};
                    int ok=0;
                    do {
                        if (g[a[0]][a[1]]&&g[a[1]][a[2]]&&g[a[2]][a[3]]&&g[a[3]][a[0]]&&!g[a[0]][a[2]]&&!g[a[1]][a[3]]) {
                            ok=1;
                            break;
                        }
                    } while (next_permutation(a,a+4));
                    if (ok) ans++;
                }
    cout<<ans<<endl;
    return 0;
}