#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll inf = LONG_LONG_MAX / 2 - 1;
    ll n, m;
    cin >> n >> m;
    vector<vector<ll>> dp(n, vector<ll>(n, inf));
    rep(i, n) dp[i][i] = 0;
    rep(i, m) {
        ll a, b;
        cin >> a >> b;
        a--; b--;
        dp[a][b] = 1;
        dp[b][a] = 1;
    }
    rep(i, n) rep(j, n) rep(k, n) dp[j][k] = min(dp[j][k], dp[j][i] + dp[i][k]);
    ll ans = 0;
    rep(i, n) {
        reps(j, i + 1, n) {
            reps(k, j + 1, n) {
                if ((dp[i][j] != 2) && (dp[i][k] != 2) && (dp[j][k] != 2)) {
                    ans++;
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
}