//from duckindog wth depression
#include<bits/stdc++.h>

using namespace std;

#define int long long

const int N = 3e5 + 10;
int n, m;
int a[N], b[N];
struct IT {
  //0->11; 1->01; 2->00; 3->10;
  int f4[N << 2][4], f2[N << 2][2], sz[N];
  void update(int s, int l, int r, int i, int x) {
    if (i < l || i > r) return;
    if (l == r) {
      sz[s] += x;
      int val = sz[s] / 4 * 2;
      f4[s][0] = val + min(2ll, sz[s] % 4);
      f4[s][1] = val + (sz[s] % 4 >= 2) + (sz[s] % 4 == 3);
      f4[s][2] = val + (sz[s] % 4 == 3);
      f4[s][3] = val + (sz[s] % 4 >= 1);
      for (int j = 0; j < 4; ++j) f4[s][j] *= i;
      for (int j = 0; j < 2; ++j) f2[s][j] = (sz[s] + j) / 2 * i;
      return;
    }
    int mid = l + r >> 1;
    update(s << 1, l, mid, i, x); update(s << 1 | 1, mid + 1, r, i, x);
    sz[s] = sz[s << 1] + sz[s << 1 | 1];
    for (int j = 0; j < 4; ++j) {
      int t = (j + sz[s << 1]) % 4;
      f4[s][t] = f4[s << 1][t] + f4[s << 1 | 1][j];
    }
    for (int j = 0; j < 2; ++j) {
      int t = (j + sz[s << 1]) % 2;
      f2[s][t] = f2[s << 1][t] + f2[s << 1 | 1][j];
    }
  }
} pos, neg;

int sum = 0;
int cal() {
  bool player = (neg.sz[1] % 2 == 0);
  return sum + neg.f4[1][3] + pos.f2[1][player];
}

int32_t main() {
  cin.tie(0)->sync_with_stdio(0);

  if (fopen("duck.inp", "r")) {
    freopen("duck.inp", "r", stdin);
    freopen("duck.out", "w", stdout);
  }
  cin >> n >> m;

  for (int i = 1; i <= n; ++i) {
    cin >> a[i] >> b[i];
    sum += b[i];
    if (a[i] - b[i] <= 0) neg.update(1, -1e5, 0, a[i] - b[i], 1);
    else pos.update(1, 1, 1e5, a[i] - b[i], 1);
  }

  cout << cal() << "\n";
  for (int i = 1; i <= m; ++i) {
    int t, x, y; cin >> t >> x >> y;
    sum = sum - b[t] + y;

    if (a[t] - b[t] <= 0) neg.update(1, -1e5, 0, a[t] - b[t], -1);
    else pos.update(1, 1, 1e5, a[t] - b[t], -1);
    a[t] = x; b[t] = y;
    if (a[t] - b[t] <= 0) neg.update(1, -1e5, 0, a[t] - b[t], 1);
    else pos.update(1, 1, 1e5, a[t] - b[t], 1);

    cout << cal() << "\n";
  }

}