#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 200'001;

ll befok[MAXN];

ll f(ll x) {
    return x*(x-1)/2;
}

void solve() {
    ll n, q; cin >> n >> q;
    for (int i = 1; i <= n; i++) befok[i] = i-1;
    ll tot = n*(n-1)*(n-2)/6, bad = 0;
    auto upd = [&](int i, ll multi) {
        bad += f(befok[i])*multi;
    };
    for (int i = 1; i <= n; i++) upd(i, 1);
    while (q--) {
        int x, y; cin >> x >> y;
        upd(x, -1);
        upd(y, -1);
        befok[x]++;
        befok[y]--;
        upd(x, 1);
        upd(y, 1);
        cout << tot-bad << "\n";
    }
}

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