#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>
#define MAXN 30010
#define MAX 999999999
using namespace std;
const int fx[5]={0,1,-1,0,0},fy[5]={0,0,0,1,-1};
int n,m,s,t,c=2,sum=0;
int head[MAXN],deep[MAXN];
struct Edge{int next,to,w;
}a[MAXN*10];
inline int read(){int date=0,w=1;char c=0;while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}while(c>='0'&&c<='9'){date=date*10+c-'0';c=getchar();}return date*w;
}
inline int id(int x,int y){return (x-1)*m+y;}
inline void add(int u,int v,int w){a[c].to=v;a[c].w=w;a[c].next=head[u];head[u]=c++;a[c].to=u;a[c].w=0;a[c].next=head[v];head[v]=c++;
}
bool bfs(){int u,v;queue<int> q;for(int i=1;i<=t;i++)deep[i]=0;deep[s]=1;q.push(s);while(!q.empty()){u=q.front();q.pop();for(int i=head[u];i;i=a[i].next){v=a[i].to;if(a[i].w&&!deep[v]){deep[v]=deep[u]+1;if(v==t)return true;q.push(v);}}}return false;
}
int dfs(int x,int limit){if(x==t)return limit;int v,sum,cost=0;for(int i=head[x];i;i=a[i].next){v=a[i].to;if(a[i].w&&deep[v]==deep[x]+1){sum=dfs(v,min(a[i].w,limit-cost));if(sum>0){a[i].w-=sum;a[i^1].w+=sum;cost+=sum;if(cost==limit)break;}else deep[v]=-1;}}return cost;
}
int dinic(){int ans=0;while(bfs())ans+=dfs(s,MAX);return ans;
}
void init(){int x,y,u,v,w,z;n=read();m=read();z=n*m;s=z*3+1;t=z*3+2;for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){w=read();add(s,id(i,j),w);sum+=w;}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){w=read();add(id(i,j),t,w);sum+=w;}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){w=read();add(s,id(i,j)+z,w);sum+=w;}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){w=read();add(id(i,j)+z*2,t,w);sum+=w;}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){u=id(i,j);for(int k=0;k<5;k++){x=i+fx[k];y=j+fy[k];if(x<1||x>n||y<1||y>m)continue;v=id(x,y);add(z+v,u,MAX);add(u,v+z*2,MAX);}}
}
int main(){init();printf("%d\n",sum-dinic());return 0;
}