#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf = 1e9+7;

int N, M;
bool edge[55][55];
int ans;
int main() {
    cin>>N>>M;
    int a, b;
    REP(i,0,M){
        cin>>a>>b;
        edge[a][b]=edge[b][a]=true;
    }
    REP(i,0,N){
        REP(j,i+1,N){
            REP(k,j+1,N){
                REP(l,k+1,N){
                    int d1 = edge[i][j] + edge[i][k] + edge[i][l];
                    int d2 = edge[j][k] + edge[j][l] + edge[j][i];
                    int d3 = edge[k][l] + edge[k][i] + edge[k][j];
                    int d4 = edge[l][i] + edge[l][j] + edge[l][k];
                    if(d1==2&&d2==2&&d3==2&&d4==2) {
                        ans++;
                    }
                }
            }
        }
    }
    p(ans);
    return 0;

}