#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int sum, R, C;
vector<vector<int>> H(5050,vector<int>(210,INF)), V(5050,vector<int>(210,INF));
void init(int Rt, int Ct, int tH[5000][200], int tV[5000][200]) {
/* ... */
R = Rt; C = Ct;
for (int i = 0; i < 5000; i++) for (int j = 0; j < 200; j++) {H[i][j] = tH[i][j]; V[i][j] = tV[i][j];}
}
void changeH(int P, int Q, int W) {
/* ... */
H[P][Q] = W;
}
void changeV(int P, int Q, int W) {
/* ... */
V[P][Q] = W;
}
int escape(int V1, int V2) {
// assert(V1 == 0 && V2 == 0);
priority_queue<tuple<int,int,int>> pq;
vector<vector<int>> dist(R,vector<int>(C,-1));
pq.push(make_tuple(V1,0,0));
while (!pq.empty()) {
int c,r,d; tie(c,r,d) = pq.top(); pq.pop();
if (dist[r][c] != -1) continue;
d *= -1;
dist[r][c] = d;
if (c > 0) pq.push(make_tuple(c-1,r,-(d + H[r][c-1])));
if (c < C-1) pq.push(make_tuple(c+1,r,-(d + H[r][c])));
if (r < R-1) pq.push(make_tuple(c,r+1,-(d + V[r][c])));
}
return dist[R-1][V2];
}
