#include <bits/stdc++.h>

using namespace std;
using ll = long long int;
const ll inf = 1e9;

ll melting[110][110];
ll dijkstra[110][110] = {0};
ll fish[110][110];
bool done[110][110] = {false};
int n, m;

vector<pair<int,int>> adj(pair<int,int> p){
  vector<pair<int,int>> v;
  for(int i = -1; i < 2; ++i){
    for(int j = -1; j < 2; ++j){
      if(abs(i + j) == 1 && p.first + i >= 0 && p.first + i < n && 
        p.second + j >= 0 && p.second + j < m){
          v.push_back({p.first + i, p.second + j});
      }
    }
  }
  return v;
}

int main()
{
  cin >> n >> m;
  pair<int,int> home;
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      cin >> melting[i][j];
      if(melting[i][j] == -1){
        home = {i, j};
      }
    }
  }
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      cin >> fish[i][j];
    }
  }
  dijkstra[home.first][home.second] = inf;
  priority_queue<pair<int,pair<int,int>>> q;
  q.push({inf, home});
  while(!q.empty()){
    auto p = q.top().second;
    q.pop();
    if(done[p.first][p.second]) continue;
    done[p.first][p.second] = true;
    vector<pair<int,int>> g = adj(p);
    for(auto i : g){
      if(dijkstra[i.first][i.second] < min(dijkstra[p.first][p.second], melting[i.first][i.second])){
        dijkstra[i.first][i.second] = min(dijkstra[p.first][p.second], melting[i.first][i.second]);
        q.push({dijkstra[i.first][i.second], i});
      }
    }
  }
  map<ll,ll> v;
  ll fish_sum = 0;
  for(int i = 0; i < n; ++i){
    for(int j = 0; j < m; ++j){
      if(melting[i][j] == -1) continue;
      v[dijkstra[i][j]] += fish[i][j];
      fish_sum += fish[i][j];
    }
  }
  ll sol = 0;
  for(auto i : v){
    if(sol + fish_sum < i.first + 1){
      sol += fish_sum;
      break;
    }
    fish_sum -= i.second;
    sol = i.first;
  }
  sol += fish[home.first][home.second] + 1;
  cout << sol << endl;
  return 0;
}