#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5, inf = 1e9;

int a[N], lst[N];
vector< array<int, 3> > mdf[N];
vector<int> qry[N];
long long res[N];

struct Info {
    int mn, mnc, sec, lz;
    long long k, lzk, b, lzb;

    void apply(int x, long long tk, long long tb) {
        if (x <= mn) return;
        assert(x < sec);
        mn = lz = x, k += tk * mnc, b += tb * mnc, lzk += tk, lzb += tb;
    }
} p[1 << 21];

void build(int k, int l, int r) {
    p[k].mnc = r - l + 1, p[k].sec = inf, p[k].lz = -inf;
    if (l == r) return;
    int mid = (l + r) >> 1;
    build(k << 1, l, mid), build(k << 1 | 1, mid + 1, r);
}

void pushdown(int k) {
    if (p[k].lz != -inf) {
        p[k << 1].apply(p[k].lz, p[k].lzk, p[k].lzb);
        p[k << 1 | 1].apply(p[k].lz, p[k].lzk, p[k].lzb);
        p[k].lz = -inf, p[k].lzk = p[k].lzb = 0;
    }
}

void pushup(int k) {
    if (p[k << 1].mn == p[k << 1 | 1].mn) {
        p[k].mn = p[k << 1].mn;
        p[k].mnc = p[k << 1].mnc + p[k << 1 | 1].mnc;
        p[k].sec = min(p[k << 1].sec, p[k << 1 | 1].sec);
    } else {
        int t = (p[k << 1].mn < p[k << 1 | 1].mn ? k << 1 : k << 1 | 1);
        p[k].mn = p[t].mn, p[k].mnc = p[t].mnc;
        p[k].sec = min(p[t].sec, p[t ^ 1].mn);
    }
    p[k].k = p[k << 1].k + p[k << 1 | 1].k, p[k].b = p[k << 1].b + p[k << 1 | 1].b;
}

void modify(int k, int l, int r, int x, int y, int z, int w) {
    if (l > y || r < x || p[k].mn >= z) return;
    if (l >= x && r <= y && p[k].sec > z) {
        p[k].apply(z, z - p[k].mn, -1ll * (z - p[k].mn) * w);
        return;
    }
    pushdown(k);
    int mid = (l + r) >> 1;
    modify(k << 1, l, mid, x, y, z, w);
    modify(k << 1 | 1, mid + 1, r, x, y, z, w);
    pushup(k);
}

long long query(int k, int l, int r, int x, int y, int z) {
    if (l > y || r < x) return 0;
    if (l >= x && r <= y) return p[k].k * z + p[k].b;
    pushdown(k);
    int mid = (l + r) >> 1;
    return query(k << 1, l, mid, x, y, z) + query(k << 1 | 1, mid + 1, r, x, y, z);
}

signed main() {
    int n, q; scanf("%d%d", &n, &q);
    for (int i = 1; i <= q; ++i) {
        int x, y; scanf("%d%d", &x, &y);
        mdf[x].push_back({lst[x] + 1, i - 1, a[x]}), a[x] = y;
        lst[x] = i - 1;
        qry[x].push_back(i);
    }
    for (int i = 1; i <= n; ++i) {
        mdf[i].push_back({lst[i] + 1, q, a[i]});
    }
    build(1, 1, q);
    for (int i = 1; i <= n; ++i) {
        for (auto [x, y, z] : mdf[i]) modify(1, 1, q, x, y, z, i - 1);
        for (auto x : qry[i]) res[x] = query(1, 1, q, 1, x, i);
    }
    for (int i = 1; i <= q; ++i) printf("%lld\n", res[i]);
    return 0;
}