/* -*- coding: utf-8 -*-
 *
 * 488.cc: No.488 四角関係 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 50;
const int INF = 1 << 30;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

bool ds[MAX_N][MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  cin >> n >> m;

  for (int i = 0; i < m; i++) {
    int ai, bi;
    cin >> ai >> bi;
    ds[ai][bi] = ds[bi][ai] = true;
  }

  int cnt = 0;
  
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++)
      if (ds[i][j])
	for (int k = j + 1; k < n; k++)
	  if (ds[i][k] && ! ds[j][k])
	    for (int l = i + 1; l < n; l++)
	      if (ds[j][l] && ds[k][l] && ! ds[i][l]) cnt++;

  printf("%d\n", cnt);
  return 0;
}