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

typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

#define eb emplace_back
#define pb push_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

constexpr int N = 100007;

struct node {
    ll sum[4];
    int cnt;
    node(){cnt = 0; memset(sum, 0, sizeof(sum));};
    node operator + (const node &obj) const {
        node ret;
        ret.cnt = cnt + obj.cnt;
        rep(i, 0, 3) ret.sum[i] = sum[i];
        rep(i, 0, 3) ret.sum[(i + cnt) % 4] += obj.sum[i];
        return ret;
    }
};

struct segtree {
#define ls (rt << 1)
#define rs (rt << 1 | 1)
#define mid ((l + r) >> 1)
    node c[N << 2];
    void upd(int rt, int l, int r, int pos, bool w) {
        if (l == r) {
            if (w) {
                c[rt].cnt++;
                c[rt].sum[c[rt].cnt % 4] += pos;
            } else {
                c[rt].sum[c[rt].cnt % 4] -= pos;
                c[rt].cnt--;
            }
            return;
        }
        pos <= mid ? upd(ls, l, mid, pos, w) : upd(rs, mid + 1, r, pos, w);
        c[rt] = c[ls] + c[rs];
    }
} t1, t2;

int a[N], b[N];

ll sumb = 0;

int main() {
    int n = rd(), q = rd();
    rep(i, 1, n) {
        a[i] = rd(); b[i] = rd(); sumb += b[i];
        if (a[i] > b[i]) t2.upd(1, 1, 100000, a[i] - b[i], 1);
        else t1.upd(1, 1, 100000, b[i] - a[i], 1);
    }
    auto calc = [&]() {
        node A = t1.c[1], B = t2.c[1];
        //printf("%d %lld %lld %lld %lld\n", A.cnt, A.sum[0], A.sum[1], A.sum[2], A.sum[3]);
       // printf("%d %lld %lld %lld %lld\n", B.cnt, B.sum[0], B.sum[1], B.sum[2], B.sum[3]);
        int cnt = A.cnt;
        ll ans = sumb;
        ans -= A.sum[cnt % 4];
        ans -= A.sum[(cnt + 1) % 4];
        //printf("%lld\n", ans);
        ans += B.sum[(cnt + 1) % 2];
        ans += B.sum[(cnt + 1) % 2 + 2];
        return ans;
    };
    printf("%lld\n", calc());
    rep(t, 1, q) {
        int i = rd();
        if (a[i] > b[i]) t2.upd(1, 1, 100000, a[i] - b[i], 0);
        else t1.upd(1, 1, 100000, b[i] - a[i], 0);
        sumb -= b[i];
        a[i] = rd(); b[i] = rd(); sumb += b[i];
        if (a[i] > b[i]) t2.upd(1, 1, 100000, a[i] - b[i], 1);
        else t1.upd(1, 1, 100000, b[i] - a[i], 1);
        printf("%lld\n", calc());
    }
    return 0;
}