#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef vector<vector<ll>> vll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second

struct segtree{
    vi tl, tr, sm;
    void build(int v, int l, int r){
        tl[v]=l; tr[v]=r;
        if (l==r) return;
        int tm = (l+r)/2;
        build(2*v,l,tm); build(2*v+1,tm+1,r);
    }
    void init(int n){
        tl.assign(4*n,0); tr.assign(4*n,0);
        sm.assign(4*n,0);
        build(1,0,n-1);
    }
    void upd(int v, int pos, int val){
        if (tl[v]==tr[v]){
            sm[v] = val; return;
        }
        int tm = (tl[v]+tr[v])/2;
        if (pos <= tm) upd(2*v,pos,val);
        else upd(2*v+1,pos,val);
        sm[v] = sm[2*v] + sm[2*v+1];
    }
    int get(int v, int l, int r){
        if (tl[v]==l && tr[v]==r) return sm[v];
        if (l>r) return 0;
        int tm = (tl[v]+tr[v])/2;
        return get(2*v,l,min(r,tm)) + get(2*v+1,max(l,tm+1),r);
    }
};

segtree st;
int ans = 0;
vector<vi> h, v;
int r,c;


void init(int R, int C, int H[5000][200], int V[5000][200]) {
    /* ... */
    r=R; c=C;
    FOR(i,0,R){
        h.pb({});
        FOR(j,0,C-1){
            h[i].pb(H[i][j]);
        }
    }
    FOR(i,0,R-1){
        v.pb({});
        FOR(j,0,C){
            v[i].pb(V[i][j]);
            ans += V[i][j];
        }
    }
}

void changeH(int P, int Q, int W) {
    /* ... */
}

void changeV(int P, int Q, int W) {
    ans += (W-v[P][0]);
    v[P][0] = W;
    /* ... */
}

int escape(int V1, int V2) {
    return ans;
}