#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int N,M;
    cin >> N >> M;
    vector< vector<int> > P(N,vector<int>(N,0));
    for ( int i = 0; i < M; i++ ) {
        int a,b;
        cin >> a >> b;
        P[a][b] = 1;
        P[b][a] = 1;
    }
    int ans = 0;
    for ( int a = 0; a < N; a++ ) {
    for ( int b = a+1; b < N; b++ ) {
    for ( int c = b+1; c < N; c++ ) {
    for ( int d = c+1; d < N; d++ ) {
        int x[4] = { a,b,c,d };
        bool ok = true;
        for ( int i = 0; i < 4; i++ ) {
            int y = 0;
            for ( int j = 0; j < 4; j++ ) {
                if ( P[x[i]][x[j]] ) { y++; }
            }
            if ( y != 2 ) { ok = false; }
        }
        if ( ok ) { ans++; }
    }
    }
    }
    }
    cout << ans << endl;
    return 0;
}