#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<queue>
#define Max(a,b) (a>b?a:b)
#define Min(a,b) (a<b?a:b)
#define INF 0x3f3f3f3f
using namespace std;
int n,m,s,t,level[50005],head[50005],cnt=0,ans=0;
int dx[5]={1,-1,0,0,0},dy[5]={0,0,1,-1,0};
struct Node{int next,to,cap;
}Edges[1000005];
int Read()
{int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
void addedge(int u,int v,int c)
{Edges[cnt].next=head[u];head[u]=cnt;Edges[cnt].to=v;Edges[cnt++].cap=c;
}
void Insert(int u,int v,int c)
{addedge(u,v,c);addedge(v,u,0);
}
int number(int i,int j)
{return (i-1)*m+j;
}
bool bfs()
{memset(level,-1,sizeof(level));queue<int>q;q.push(s);level[s]=0;while(!q.empty()){int u=q.front();q.pop();for(int i=head[u];~i;i=Edges[i].next){int v=Edges[i].to;if(level[v]==-1&&Edges[i].cap)level[v]=level[u]+1,q.push(v);}}if(level[t]==-1)return false;return true;
}
int dfs(int u,int Maxflow)
{if(u==t)return Maxflow;int flow=0,d;for(int i=head[u];~i&&Maxflow>flow;i=Edges[i].next){int v=Edges[i].to;if(level[v]==level[u]+1&&Edges[i].cap){d=dfs(v,Min(Maxflow-flow,Edges[i].cap));Edges[i].cap-=d;Edges[i^1].cap+=d;flow+=d;}}if(!flow)level[u]=-1;return flow;
}
int Dinic()
{int res=0,d;while(bfs()){while(d=dfs(s,INF))res+=d;}return res;
}
int main()
{memset(head,-1,sizeof(head));n=Read(),m=Read();s=0,t=3*n*m+1;for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){int art=Read();ans+=art;Insert(s,number(i,j),art);}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){int science=Read();ans+=science;Insert(number(i,j),t,science);}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){int same_art=Read(),p=number(i,j)+m*n;ans+=same_art;Insert(s,p,same_art);for(int k=0;k<5;k++){if(i+dx[k]>0&&i+dx[k]<=n&&j+dy[k]>0&&j+dy[k]<=m)Insert(p,number(i+dx[k],j+dy[k]),INF);}}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){int same_science=Read(),p=number(i,j)+2*m*n;ans+=same_science;Insert(p,t,same_science);for(int k=0;k<5;k++){if(i+dx[k]>0&&i+dx[k]<=n&&j+dy[k]>0&&j+dy[k]<=m)Insert(number(i+dx[k],j+dy[k]),p,INF);}}printf("%d\n",ans-Dinic());return 0;
}