#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
int g[50][50];

int main(){

   int N, M;
   cin>> N>> M;
   int a[M], b[M];
   for(int i=0; i<M; i++){
      cin>> a[i]>> b[i];
      g[a[i]][b[i]]=g[b[i]][a[i]]=1;
   }

   int r=0;
   for(int s=0; s<N; s++){
      for(int t=s+1; t<N; t++){
         for(int u=t+1; u<N; u++){
            for(int v=u+1; v<N; v++){
               vector<int> x={s, t, u, v};
               sort(x.begin(), x.end());
               do{
                  if(g[x[0]][x[1]]&&g[x[1]][x[2]]&&g[x[2]][x[3]]&&g[x[3]][x[0]]){
                     if(!g[x[0]][x[2]]&&(!g[x[1]][x[3]])){
                        r++;
                        break;
                     }
                  }
               }while(next_permutation(x.begin(), x.end()));
            }
         }
      }
   }

   cout<< r<< endl;
}