#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
}

template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

int width, height;
int m, n;


int g[60][60];

int main() {
    int i, j, k, l;
    int x, y, a, b;


    cin >> n >> m;

    for (i = 0; i < m; ++i) {
        cin >> a >> b;
        g[b][a] = g[a][b] = 1;
    }

    int cnt = 0;
    for (i = 0; i < n - 3; i++) {
        for (j = i + 1; j < n - 2; j++) {
            for (k = j + 1; k < n - 1; k++) {
                for (l = k + 1; l < n; l++) {
                    if (g[i][j] && g[j][k] && g[k][l] && g[l][i] && !g[i][k] && !g[j][l]) {
                        ++cnt;
                    }
                    else if (g[i][k] && g[k][j] && g[j][l] && g[l][i] && !g[i][j] && !g[k][l]) {
                        ++cnt;
                    }
                    else if (g[i][k] && g[k][l] && g[l][j] && g[j][i] && !g[i][l] && !g[k][j]) {
                        ++cnt;
                    }
                }
            }
        }
    }
    cout << cnt << endl;

    return 0;
}