#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
constexpr int INF = 1e9;

int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> adj(n, vector<int>(n, INF));
  rep(i,m) {
    int a, b;
    cin >> a >> b;
    a--; b--;
    adj[a][b] = adj[b][a] = 1;
  }

  rep(i,n) adj[i][i] = 0;

  for (int k = 0; k < n; k++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);
    }
  }
  int res = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (adj[i][j] == 2) continue;
      for (int k = j + 1; k < n; k++) {
        if (adj[j][k] == 2 || adj[i][k] == 2) continue;
        res++;
      }
    }
  }

  cout << res << endl;
  return 0;
}