#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n,m; cin >> n >> m;
    vector<vector<int>> A(n, vector<int>(n, 1e9));
    rep(i,m) {
        int a,b; cin >> a >> b; a--; b--;
        A[a][b] = A[b][a] = 1;
    }
    rep(i,n) A[i][i] = 0;
    rep(k,n)rep(i,n)rep(j,n) A[i][j] = min(A[i][j], A[i][k] + A[k][j]);
    int ans = 0;
    rep(i,n)rep(j,i)rep(k,j) ans += (A[i][j] != 2 && A[j][k] != 2 && A[k][i] != 2);
    cout << ans << endl;
}