#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

int n, m, ret;
int d[55][55];

signed main(void)
{
  cin >> n >> m;
  REP(i, m) {
    int a, b;
    cin >> a >> b;
    d[a][b] = 1;
    d[b][a] = 1;
  }

  int ret = 0;
  REP(i, n) FOR(j, i+1, n) FOR(k, j+1, n) FOR(l, k+1, n) {
    //cout << i << " " << j << " " << k << " " << l << endl;
    //cout << d[i][j] << " " << d[j][k] << " " << d[k][l] << " " << d[l][i] << " " << d[i][k] << " " << d[j][l] << endl;
    if(d[i][j] && d[j][k] && d[k][l] && d[l][i] && !d[i][k] && !d[j][l]) ret++;
    if(d[i][j] && d[j][l] && d[l][k] && d[k][i] && !d[j][k] && !d[i][l]) ret++;
    if(d[i][k] && d[k][j] && d[j][l] && d[l][i] && !d[i][j] && !d[k][l]) ret++;
  }

  cout << ret << endl;

  return 0;
}