#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e17+1;

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n, m; cin >> n >> m;
    vector<vector<int>>a(n, vector<int>(m));
    vector<vector<int>>h(n, vector<int>(m));
    int x, y;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            cin >> a[i][j];
            if(a[i][j] == -1) {x = i; y = j;}
        }
    }
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            cin >> h[i][j];
    vector<vector<int>>d(n, vector<int>(m, -1));
    priority_queue<array<int, 3>>pq;
    pq.push({INF, x, y});
    d[x][y] = INF;
    while(!pq.empty())
    {
        auto [mx, i, j] = pq.top();
        pq.pop();
        if(mx != d[i][j]) continue;
        if(i > 0 && d[i-1][j] < d[i][j]) {d[i-1][j] = min(d[i][j], a[i-1][j]); pq.push({d[i-1][j], i-1, j});}
        if(i < n-1 && d[i+1][j] < d[i][j]) {d[i+1][j] = min(d[i][j], a[i+1][j]); pq.push({d[i+1][j], i+1, j});}
        if(j > 0 && d[i][j-1] < d[i][j]) {d[i][j-1] = min(d[i][j], a[i][j-1]); pq.push({d[i][j-1], i, j-1});}
        if(j < m-1 && d[i][j+1] < d[i][j]) {d[i][j+1] = min(d[i][j], a[i][j+1]); pq.push({d[i][j+1], i, j+1});}
    }
    int ans = -1;
    map<int, int>f;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            f[d[i][j]] += h[i][j];
        }
    }
    for(auto [v, k] : f)
    {
        if(v <= ans) continue;
        ans = min(ans + k, v);
    }
    cout << ans + 1;
}