//汽车拉力赛
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N = 1000 + 100;
struct Point {
	ll x, y;
} p[N];
ll n, m, cnt;
ll fa[N], a[N][N], dx[5] = {0, 0, 1, -1}, dy[5] = {1, -1, 0, 0};
ll fin(ll x) {
	if (fa[x] == x) return x;
	return fa[x] = fin(fa[x]);
}
bool check(ll d) {
	for (ll i = 1; i <= n * m; i++) fa[i] = i;
	queue<Point> q;
	q.push({p[1].x, p[1].y});
	bool vis[N][N];
	memset(vis, 0, sizeof vis);
	while (q.size()) {
		ll x = q.front().x, y = q.front().y;
		vis[x][y]=1;
		q.pop();
		for (ll i = 0; i < 4; i++) {
			ll xx = x + dx[i], yy = y + dy[i];
			if (!vis[xx][yy]&&xx >= 1 && xx <= n && yy >= 1 && yy <= m && abs(a[xx][yy] - a[x][y])<=d){
				q.push({xx,yy});
				ll t1=fin((xx)*m+yy),t2=fin((x)*m+y);
				fa[t1]=t2;
			}
		}
	}
	for(ll i=2;i<=cnt;i++){
		if(fin(fa[(p[i].x)*m+p[i].y])!=fin(fa[(p[1].x)*m+p[1].y])) return 0;
	}
	return 1;
}
int main() {
	cin >> n >> m;

	for (ll i = 1; i <= n; i++) {
		for (ll j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	for (ll i = 1; i <= n; i++) {
		for (ll j = 1; j <= m; j++) {
			ll x;
			cin >> x;
			if (x == 1) {
				cnt++;
				p[cnt].x = i;
				p[cnt].y = j;
			}
		}
	}
	ll l = 0, r = 1e9+100, mid;
	while (l < r) {
		mid = (l + r) >> 1;
		if (check(mid)) {
			r = mid;
		} else {
			l = mid + 1;
		}
	}
	cout << l;
	return 0;
}