#include <bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
#define int ll
using ld = long double;
using pii = pair<int, int>;

#define F first
#define S second

const ld PI = 3.1415926535;
const int N = 2e5 + 5;
const int M = 1e7 + 1;
ll mod;
const int infi = 1e9;
const ll infl = 1e16;
const int P = 31;

int mult(int a, int b) { return a * 1LL * b % mod; }

int sum(int a, int b) {
    if(a + b >= mod)
        return a + b - mod;
    if(a + b < 0)
        return a + b + mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0) return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % (mod + 1);
    } else {
        ll b = binpow(a, n / 2);
        return b * b % (mod + 1);
    }
}

int n, m, p[N], sz[N];
set<int> st[N];
vector<int> g[N];

int getp(int v){
    if(p[v] == v)
        return v;
    return p[v] = getp(p[v]);
}

void uni(int a, int b){
    a = getp(a);
    b = getp(b);
    if(a == b)
        return;
    if(sz[a] > sz[b])
        swap(a, b);
    sz[b] += sz[a];
    p[a] = b;
    if(st[a].size() > st[b].size()){
        for(auto e : st[b])
            st[a].insert(e);
        st[b].swap(st[a]);
    }else{
        for(auto e : st[a])
            st[b].insert(e);
    }
}

void solve() {
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        int u, v;
        cin >> u >> v;
        g[v].push_back(u);
        g[u].push_back(v);
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        p[i] = i;
        sz[i] = 1;
        for(auto e : g[i])
            if(e > i)
                st[i].insert(e);
        for(auto e : g[i]){
            if(e < i)
                uni(e, i);
        }
        int v = getp(i);
        st[v].erase(i);
        ans += st[v].size();
        for(auto e : g[i])
            if(e > i && st[v].find(e) != st[v].end())
                ans--;
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}