#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  int N, M;
  cin >> N >> M;
  bool boad[N][N];
  FOR (i,0,N) {
    FOR (j,0,N) {
      boad[i][j] = false;
      if(i == j) boad[i][j] = true;
    }
  }
  FOR (i,0,M) {
    int a, b;
    cin >> a >> b;
    boad[a][b] = boad[b][a] = true;
  }
  int ans = 0;
  FOR (i,0,N) {
    FOR (j,i,N) {
      FOR (k,j,N) {
        FOR (l,k,N) {
          int poi[4] = {i,j,k,l};
          if(boad[i][j]+boad[i][k]+boad[i][l]!=2) continue;
          if(boad[j][i]+boad[j][k]+boad[j][l]!=2) continue;
          if(boad[k][i]+boad[k][j]+boad[k][l]!=2) continue;
          if(boad[l][i]+boad[l][j]+boad[l][k]!=2) continue;
          ans++;
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}