#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define N 11000
using namespace std;
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0;char ch=gc();
while(ch<'0'||ch>'9') ch=gc();
while(ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
return x;
}
int num=1,dx[]={0,1,-1,0},dy[]={1,0,0,-1},level[N],id[110][110],mp[110][110],h[N],T,n,m;
struct node{
int y,z,next;
}data[120000];
inline void insert1(int x,int y,int z){
data[++num].y=y;data[num].z=z;data[num].next=h[x];h[x]=num;
data[++num].y=x;data[num].z=0;data[num].next=h[y];h[y]=num;
}
inline bool bfs(){
memset(level,0,sizeof(level));queue<int>q;level[0]=1;q.push(0);
while(!q.empty()){
int x=q.front();q.pop();
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (level[y]||!z) continue;level[y]=level[x]+1;q.push(y);if (y==T) return 1;
}
}return 0;
}
inline int dfs(int x,int s){
if (x==T) return s;int ss=s;
for (int i=h[x];i;i=data[i].next){
int y=data[i].y,z=data[i].z;
if (level[x]+1==level[y]&&z){
int xx=dfs(y,min(z,s));if (!xx) level[y]=0;s-=xx;
data[i].z-=xx;data[i^1].z+=xx;if (!s) return ss;
}
}return ss-s;
}
int main(){
freopen("bzoj2132.in","r",stdin);
n=read();m=read();int tot=0;T=n*m+1;
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j) id[i][j]=++tot;tot=0;
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j) {int tmp=read();if (i+j&1) insert1(id[i][j],T,tmp);else insert1(0,id[i][j],tmp);tot+=tmp;}
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j) {int tmp=read();if (i+j&1) insert1(0,id[i][j],tmp);else insert1(id[i][j],T,tmp);tot+=tmp;}
for (int i=1;i<=n;++i)
for (int j=1;j<=m;++j) mp[i][j]=read();
for (int i=1;i<=n;++i){
for (int j=1;j<=m;++j){
if ((i+j)&1)continue;
for (int k=0;k<4;++k){
int x1=i+dx[k],y1=j+dy[k];
if (x1<1||x1>n||y1<1||y1>m) continue;insert1(id[i][j],id[x1][y1],mp[i][j]+mp[x1][y1]);
insert1(id[x1][y1],id[i][j],mp[i][j]+mp[x1][y1]);tot+=mp[i][j]+mp[x1][y1];
}
}
}int ans=0;while(bfs()) ans+=dfs(0,inf);
printf("%d",tot-ans);
return 0;
}