#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e5 + 5, _ = 1e5;
ll n, m, a[N], b[N], cnt[N], cnt2[N];
namespace sgt{
    struct node{
        ll len, tot, sum[4];
        //ABBA ABBA ABBA...
        node(ll val = 0, ll num = 0){
            len = num, sum[0] = sum[1] = sum[2] = sum[3] = 0;
            tot = val * num;
            if(num){
                int t = num % 4;
                sum[0] = (num / 4 * 2 + min(t, 1)) * val;
                sum[1] = (num / 4 * 2 + max(0, t - 2)) * val;
                sum[2] = (num / 4 * 2 + max(0, t - 1)) * val;
                sum[3] = (num / 4 * 2 + min(t, 2)) * val;
            }
        }
        node operator+(const node b)const{
            node c; c.len = len + b.len, c.tot = tot + b.tot;
            _rep(i, 0, 3) c.sum[i] = sum[i] + b.sum[(i + len) % 4];
            return c;
        }
    }tr[N << 2];
    #define ls x << 1
    #define rs x << 1 | 1
    void modify(int x, int l, int r, int p){
        if(l == r) return tr[x] = node(p, cnt[p]), void();
        int mid = l + r >> 1;
        if(p <= mid) modify(ls, l, mid, p);
        else modify(rs, mid + 1, r, p);
        tr[x] = tr[rs] + tr[ls];
    }
}
namespace sgt2{
    struct node{
        ll len, tot, sum[2];
        //ABABABAB
        node(ll val = 0, ll num = 0){
            len = num, sum[0] = sum[1] = 0;
            tot = val * num;
            if(num){
                int t = num % 2;
                sum[0] = (num / 2 + t) * val;
                sum[1] = (num / 2) * val;
            }
        }
        node operator+(const node b)const{
            node c; c.len = len + b.len, c.tot = tot + b.tot;
            _rep(i, 0, 1) c.sum[i] = sum[i] + b.sum[(i + len) % 2];
            return c;
        }
    }tr[N << 2];
    #define ls x << 1
    #define rs x << 1 | 1
    void modify(int x, int l, int r, int p){
        if(l == r) return tr[x] = node(p, cnt2[p]), void();
        int mid = l + r >> 1;
        if(p <= mid) modify(ls, l, mid, p);
        else modify(rs, mid + 1, r, p);
        tr[x] = tr[ls] + tr[rs];
    }
}
ll sum;
ll calc(){
    int cur = sgt::tr[1].len;
    if(cur % 4 == 1 || cur % 4 == 3){
        return sgt::tr[1].sum[0] - (sgt2::tr[1].tot - sgt2::tr[1].sum[0]);
    }
    return sgt::tr[1].sum[0] - sgt2::tr[1].sum[0];
}
void ins(int i, int op){
    sum += b[i] * op;
    if(a[i] >= 0) cnt[a[i]] += op, sgt::modify(1, 1, _, a[i]);
    else cnt2[-a[i]] += op, sgt2::modify(1, 1, _, -a[i]);
}
int main(){
    read(n, m);
    _rep(i, 1, n){
        ll x, y; read(x, y), a[i] = y - x, b[i] = y;
        ins(i, 1);
    }
    writeln(sum - calc());
    while(m--){
        int t, x, y; read(t, x, y);
        ins(t, -1), a[t] = y - x, b[t] = y, ins(t, 1);
        writeln(sum - calc());
    }
    return 0;
}