#include<bits/stdc++.h>
#define ll long long
#define ln (p<<1)
#define rn (p<<1|1)
using namespace std;

const int N = 2e5 + 10, M = 1e5;

int n, m, a[N], b[N];

struct node {
    int l, r;
    ll val[4];
    int cnt;
};

struct segment {

    node tr[N << 2];
    int s[N];
    void pushup(int p)
    {
        tr[p].cnt = tr[ln].cnt + tr[rn].cnt;
        int t = tr[rn].cnt;
        for (int i = 0; i < 4; i++)
        {
            int j = (i + t) % 4;
            tr[p].val[i] = (tr[ln].val[j] + tr[rn].val[i]);
        }
    }

    void build(int p, int l, int r)
    {
        tr[p] = {l, r, 0, 0, 0, 0, 0};
        if (l == r)return;
        int mid = l + r >> 1;
        build(ln, l, mid), build(rn, mid + 1, r);
    }


    void change(int p, int x, int t)
    {
        if (tr[p].l == tr[p].r)
        {
            tr[p].cnt += t;
            for (int i = 0; i < 4; i++)
            {
                tr[p].val[i] = 1ll * (s[tr[p].cnt + i] - s[i]) * x;
            }
            return;
        }
        if (tr[ln].r < x)change(rn, x, t);
        else change(ln, x, t);
        pushup(p);
    }
} t1, t0;

//-4 2 6 -3

void solve()
{
    cin >> n >> m;
    t1.s[1] = 1;
    for (int i = 2; i <= 2 * n; i++) {
        if ((i / 2) % 2 == 0)t1.s[i] = 1;
        t1.s[i] += t1.s[i - 1];
        if (i % 2 == 0)t0.s[i] = 1;
        t0.s[i] += t0.s[i - 1];
    }
    ll res = 0;
    t0.build(1, 0, M * 2), t1.build(1, 0, M * 2);
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        res += b[i];
        if (a[i] > b[i])t0.change(1, b[i] - a[i] + M, 1);
        if (b[i] >= a[i])t1.change(1, b[i] - a[i], 1);
    }
    int op = (t1.tr[1].cnt % 2 == 0), t = (t0.tr[1].cnt + op ) / 2;
    cout << res - t1.tr[1].val[0] - t0.tr[1].val[op] + 1ll * t * M << '\n';
    while (m--)
    {
        int i, x, y; cin >> i >> x >> y;
        if (a[i] > b[i])t0.change(1, b[i] - a[i] + M, -1);
        if (b[i] >= a[i])t1.change(1, b[i] - a[i], -1);
        res += y - b[i];
        a[i] = x, b[i] = y;
        if (a[i] > b[i])t0.change(1, b[i] - a[i] + M, 1);
        if (b[i] >= a[i])t1.change(1, b[i] - a[i], 1);
        int op = (t1.tr[1].cnt % 2 == 0), t = (t0.tr[1].cnt + op ) / 2;
        cout << res - t1.tr[1].val[0] - t0.tr[1].val[op] + 1ll * t * M << '\n';
    }
}

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