#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, m;
    cin >> n >> m;
    int f[n][n];
    rep(i,n)rep(j,n)f[i][j] = 0;
    rep(i,m){
        int a, b;
        cin >> a >> b;
        a--; b--;
        f[a][b] = 1;
        f[b][a] = 1;
    }

    int ff[n][n];
    rep(i,n)rep(j,n) ff[i][j] = 0;

    rep(i,n){
        rep(j,n){
            srep(k,j+1,n){
                if(j == i || k == i) continue;
                if(f[i][j]&&f[i][k]&&f[j][k]==0){
                    ff[j][k] = 1;
                    ff[k][j] = 1;
                }
            }
        }
    }

    int ans = 0;
    rep(i,n){
        srep(j,i+1,n){
            srep(k,j+1,n){
                if(ff[i][j]==0&&ff[j][k]==0&&ff[k][i]==0)ans++;
            }
        }
    }
    cout << ans << endl;
    return 0;
}