#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

struct WS{
  vvl d;
  ll N;
  WS(ll n):N(n){
    d.resize(n+1, vll (n+1, 10000000000));
    init();
  }
  void init(){ re(i, N+1) d[i][i] = 0;}
  void insert(ll a, ll b, ll c){ d[a][b] = min(d[a][b], c);}
  void warshall(){
    init();
    re(i, N+1) re(s, N+1) re(t, N+1) d[s][t]=min(d[s][t],d[s][i]+d[i][t]);
  }
  vector<ll> & operator [](int n){return d[n];}
};

int main(int argc, char const *argv[]) {
  ll n, m;std::cin >> n >> m;
  WS ws(n+1);
  re(i, m){
    ll a, b;std::cin >> a >> b;
    ws.insert(a, b, 1);
    ws.insert(b, a, 1);
  }
  ws.warshall();
  ll ans = 0;
  for(int i=1;i<=n;i++){
    for(int j=i+1;j<=n;j++){
      for(int k=j+1;k<=n;k++){
        if(ws[i][j]!=2&&ws[i][k]!=2&&ws[j][k]!=2) ans++;
      }
    }
  }
  std::cout << ans << '\n';
}