#include <iostream>
#include <map>
#include <algorithm>
using namespace std;

int nodes[60][60] = {};

map<long long ,bool> memo;

int main(void){
    
    int n,m,res = 0;
    cin >> n >> m;
    
    for(int i = 0; i < m; i++){
        int a,b;
        cin >> a >> b;
        nodes[a][b] = 1;
        nodes[b][a] = 1; 
    }
    
    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++){
                    //cout << i << " " << j << " " << k << " " << l << endl;
                    //cout << nodes[i][l] << " " << nodes[l][k]  << " " << nodes[k][j] << " " << nodes[j][i] << " " << !nodes[i][k] << " " << !nodes[j][l] << endl;
                    
                    if(nodes[i][j] && nodes[j][k] && nodes[k][l] && nodes[l][i] && !nodes[i][k] && !nodes[j][l] ) res++;
                    else if(nodes[j][i] && nodes[i][k] && nodes[k][l] && nodes[l][j] && !nodes[j][k] && !nodes[i][l] ) res++;
                    else if(nodes[l][j] && nodes[j][k] && nodes[k][i] && nodes[i][l] && !nodes[l][k] && !nodes[j][i] ) res++;
                    else if(nodes[i][k] && nodes[k][j] && nodes[j][l] && nodes[l][i] && !nodes[i][j] && !nodes[k][l] ) res++;
                    else if(nodes[i][j] && nodes[j][l] && nodes[l][k] && nodes[k][i] && !nodes[i][l] && !nodes[j][k] ) res++;
                    else if(nodes[i][l] && nodes[l][k] && nodes[k][j] && nodes[j][i] && !nodes[i][k] && !nodes[j][l] ) res++;
                    else if(nodes[k][j] && nodes[j][i] && nodes[i][l] && nodes[l][k] && !nodes[i][k] && !nodes[j][l] ) res++;
                    
                }
            }
        }
    }
    
    cout << res << endl;
    
}