#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

ll inf = INT64_MAX;
ll neginf = -inf;

bool ins(ll i, ll j, ll si, ll sj, ll n, ll m) {

	if(i < si || i >= n || j < sj || j >= m) {
		return false;
	}
	return true;

}

ll calc(ll si, ll sj, ll n, ll m, vector<vector<ll>>& v, vector<vector<ll>>& c, vector<vector<ll>>& cx) {

	//cerr << "\nsi=" << si << "; sj=" << sj;
	//cerr << "\nborders=" << cx[c[si][sj]];

	ll ret = v[si][sj];

	vector<vector<ll>> dp(n, vector<ll>(m, 0));

	for(ll i = si; i <= cx[c[si][sj]][1]; i++) {
		for(ll j = sj; j <= cx[c[si][sj]][3]; j++) {
			
			dp[i][j] = v[i][j];

			if(i == si && j == sj) {
				continue;
			}

			ll come = neginf;

			if(ins(i-1, j, si, sj, n, m)) {
				come = max(come, dp[i-1][j]);
			}
			if(ins(i, j-1, si, sj, n, m)) {
				come = max(come, dp[i][j-1]);
			}

			dp[i][j] += come;

			if(c[i][j] == c[si][sj]) {
				ret = max(ret, dp[i][j]);
			}

		}
	}

	return ret;

}

void solve() {

	ll n, m;
	cin >> n >> m;

	vector<vector<ll>> v(n, vector<ll>(m, 0));
	vector<vector<ll>> c(n, vector<ll>(m, 0));

	vector<vector<ll>> cx(501, vector<ll>(4, -1));
	// 0-min i, 1=max i, 2=min j 3 = max j

	for(ll i = 0; i < n; i++) {
		for(ll j = 0; j < m; j++) {
			cin >> v[i][j];
		}
	}

	for(ll i = 0; i < n; i++) {
		for(ll j = 0; j < m; j++) {

			cin >> c[i][j];
			
			ll ch = c[i][j];

			for(ll k = 0; k < 4; k++) {
				if(cx[ch][k] == -1) {
					if(k < 2) {
						cx[ch][k] = i;
					}else{
						cx[ch][k] = j;
					}
				}
			}

			//cerr << "\ni=" << i << "; j=" << j << "; colors=" << c[i][j];

			cx[ch][0] = min(cx[ch][0], i);
			cx[ch][1] = max(cx[ch][1], i);
			cx[ch][2] = min(cx[ch][2], j);
			cx[ch][3] = max(cx[ch][3], j);
		}
	}

	ll ans = neginf/2;

	for(ll i = 0; i < n; i++) {
		for(ll j = 0; j < m; j++) {
			ans = max(ans, calc(i, j, n, m, v, c, cx));
		}
	}

	cout << ans;

}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}