#include "wombats.h"
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 405;
int n, m, d[N][N], d2[N][N];
int get (int x, int y) {
return x * m + y;
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n = R; m = C;
for (int i = 0; i < n * m; i++) {
for (int j = 0; j < n * m; j++) d[i][j] = 1e9;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m - 1; j++) {
d[get(i, j)][get(i, j + 1)] = d[get(i, j + 1)][get(i, j)] = H[i][j];
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < m; j++) {
d[get(i, j)][get(i + 1, j)] = V[i][j];
}
}
}
void changeH(int P, int Q, int W) {
d[get(P, Q)][get(P, Q + 1)] = d[get(P, Q + 1)][get(P, Q)] = W;
}
void changeV(int P, int Q, int W) {
d[get(P, Q)][get(P + 1, Q)] = W;
}
int escape(int V1, int V2) {
for (int i = 0; i < n * m; i++) {
for (int j = 0; j < n * m; j++) d2[i][j] = d[i][j];
}
for (int k = 0; k < n * m; k++) {
for (int i = 0; i < n * m; i++) {
for (int j = 0; j < n * m; j++) d2[i][j] = min(d2[i][j], d2[i][k] + d2[k][j]);
}
}
return d2[get(0, V1)][get(n - 1, V2)];
}
