#include <iostream>
using namespace std;

int graph[51][51];
int main() {
  int N, M;
  cin >> N >> M;
  while(M -- ) {
    int a, b;
    cin >> a >> b;
    graph[a][b] = graph[b][a] = 1;
  }
  int ans = 0;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      for(int k = 0; k < N; k++) {
        for(int l = 0; l < N; l++) {
          if(i == j || j == k || k == l || l == i || i == k || j == l) continue;
          if(graph[i][j] && graph[j][k] && graph[k][l] && graph[l][i] && !graph[i][k] && !graph[j][l]) {
            ans++;
          }
        }
      }
    }
  }
  cout << ans / 8 << endl;
}