#include <bits/stdc++.h>
using namespace std;
using LL = long long;

const int N = 1e5 + 5;

struct SegmentTree {
    struct segment {
        int cnt = 0;
        LL val[4] = {};

        void rot(int x) {
            x = 4 - (x & 3);
            rotate(val, val + x, val + 4);
        }
    };

    friend segment operator+(const segment &a, const segment &b) {
        segment c = b;
        c.rot(a.cnt);
        c.cnt += a.cnt;
        for (int i = 0; i < 4; i++) {
            c.val[i] += a.val[i];
        }
        return c;
    }

    int n;
    vector<segment> st;

    SegmentTree(int n_ = 0) : n(n_) { st.resize(n * 8); }

    inline void push_up(int p) {
        int lson = p << 1, rson = p << 1 | 1;
        st[p] = st[lson] + st[rson];
    }

    void build(int p, int l, int r) {
        if (l == r) {
            st[p] = segment();
            return;
        }
        int mid = (l + r) >> 1, lson = p << 1, rson = p << 1 | 1;
        build(lson, l, mid);
        build(rson, mid + 1, r);
        push_up(p);
    }

    void add(int p, int l, int r, int tar, int x) {
        if (l == r) {
            if (x == 1) {
                st[p].val[st[p].cnt & 3] += tar;
                st[p].cnt++;
            } else {
                st[p].cnt--;
                st[p].val[st[p].cnt & 3] -= tar;
            }
            // for (int i = 0; i < 4; i++) {
            //     cout << st[p].val[i] << ' ';
            // }
            // cout << endl;
            return;
        }
        int mid = (l + r) >> 1, lson = p << 1, rson = p << 1 | 1;
        if (tar <= mid) {
            add(lson, l, mid, tar, x);
        } else {
            add(rson, mid + 1, r, tar, x);
        }
        push_up(p);
    }

    void build() { build(1, -n, n); }

    void add(int tar, int x) { add(1, -n, n, tar, x); }
};

int n, q, tot, ax[N], ay[N];
array<int, 3> ques[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> q;
    LL sum = 0;
    for (int i = 1; i <= n; i++) {
        cin >> ax[i] >> ay[i];
        sum += ay[i];
    }
    for (int i = 1; i <= q; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> ques[i][j];
        }
    }

    SegmentTree st(2e5);
    st.build();
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (ax[i] <= ay[i]) {
            cnt += 2;
        }
        st.add(ax[i] - ay[i], 1);
    }

    auto get = [&]() {
        SegmentTree::segment x = st.st[2], y = st.st[3];
        y.rot(cnt);
        return sum + x.val[0] + x.val[3] + y.val[0] + y.val[3];
    };

    cout << get() << endl;
    for (int i = 1; i <= q; i++) {
        auto [t, x, y] = ques[i];
        sum -= ay[t];
        st.add(ax[t] - ay[t], -1);
        if (ax[t] <= ay[t]) {
            cnt -= 2;
        }
        ax[t] = x, ay[t] = y;
        if (ax[t] <= ay[t]) {
            cnt += 2;
        }
        sum += ay[t];
        st.add(ax[t] - ay[t], 1);
        // for (int i = 1; i <= n; i++) {
        //     cout << ax[i] << ' ' << ay[i] << endl;
        // }
        cout << get() << endl;
    }

    return 0;
}