#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

namespace mincost {
	const int V=40100,E=1001000,_inf=0x20;
	int q[V*30],vis[V],fst[V],pre[V],nxt[E],y[E],f[E],S,T,flow,tot,tn;
	const ll inf=1ll<<60;
	ll dis[V],c[E],cost;
	void init(int s,int t,int Tn) {
		tot=1; tn=Tn;
		rep(i,0,tn) fst[i]=0;
		S=s;T=t;
	}
	void add(int u,int v,int ff,int cc) {
		tot++;y[tot]=v;nxt[tot]=fst[u];f[tot]=ff;c[tot]=cc;fst[u]=tot;
		tot++;y[tot]=u;nxt[tot]=fst[v];f[tot]=0;c[tot]=-cc;fst[v]=tot;
	}
	bool spfa() {
		rep(i,0,tn) dis[i]=inf,vis[i]=0,pre[i]=0;
		dis[S]=0;q[0]=S;vis[S]=1;
		int t=1;
		rep(i,0,t) {
			int u=q[i];
			for (int j=fst[u];j;j=nxt[j]) {
				int v=y[j];
				if (f[j]&&dis[v]>dis[u]+c[j]) {
					dis[v]=dis[u]+c[j];
					pre[v]=j;
					if (!vis[v]) vis[v]=1,q[t++]=v;
				}
			}
			vis[u]=0;
		}
		return dis[T]!=inf;
	}
	void augment() {
		int p=T, _f=1<<30;
		while (pre[p]) _f=min(_f,f[pre[p]]),p=y[pre[p]^1];
		flow+=_f;cost+=_f*dis[T];
		p=T;
		while (pre[p]) f[pre[p]]-=_f,f[pre[p]^1]+=_f,p=y[pre[p]^1];
	}
	void solve() {
		flow=0,cost=0;
		while (spfa()) augment();
	}
}

const int N=55;
int n,m,p[N][N],w[N][N],id[N][N],row[N][N],col[N][N];
int main() {
	scanf("%d%d",&n,&m);
	rep(i,1,n+1) rep(j,1,m+1) scanf("%d",&p[i][j]);
	rep(i,1,n+1) rep(j,1,m+1) scanf("%d",&w[i][j]);

	int cc=0;
	rep(i,1,n+1) rep(j,1,m+1) id[i][j]=++cc;
	rep(i,1,n+1) rep(j,0,m+1) row[i][j]=++cc;
	rep(i,0,n+1) rep(j,1,m+1) col[i][j]=++cc;
	int S=0,T=++cc;
	mincost::init(S,T,T+1);
	rep(i,1,n+1) rep(j,1,m+1) {
		mincost::add(S,id[i][j],w[i][j],0);
		mincost::add(id[i][j],row[i][j-1],1,0);
		mincost::add(id[i][j],row[i][j],1,0);
		mincost::add(id[i][j],col[i-1][j],1,0);
		mincost::add(id[i][j],col[i][j],1,0);
	}
	rep(i,1,n+1) rep(j,0,m+1) {
		mincost::add(row[i][j],T,1,0);
		mincost::add(row[i][j],T,1,p[i][j]*p[i][j+1]);
	}
	rep(j,1,m+1) rep(i,0,n+1) {
		mincost::add(col[i][j],T,1,0);
		mincost::add(col[i][j],T,1,p[i][j]*p[i+1][j]);
	}
	mincost::solve();
	printf("%lld\n",mincost::cost);
}