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

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll A[50][50];

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

    // input
    ll N, M;
    cin >> N >> M;

    FOR(i, 0, M){
        ll a, b; 
        cin >> a >> b;
        A[a][b] = 1;
        A[b][a] = 1;
    }

    ll count = 0;
    FOR(i, 0, N){
        FOR(j, 0, N){
            FOR(k, 0, N){
                FOR(l, 0, N){
                    if(i==j) continue;
                    if(i==k) continue;
                    if(i==l) continue;
                    if(j==k) continue;
                    if(j==l) continue;
                    if(k==l) continue;

                    /*
                    k j
                    i l
                    */
                    if(A[i][j]==0 && A[i][k]==1 && A[i][l]==1 && A[k][j]==1 && A[l][j]==1 && A[k][l]==0){
                        count++;
                    }
                }
            }
        }
    }

    p(count/8);
    
    return 0;
}