#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
typedef long long LL;
#define mem(a,b) memset(a,b,sizeof(a))
typedef pair<LL,int> PLI;
inline int read()
{int x=0,f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}while(isdigit(c)){x=x*10+c-'0';c=getchar();}return x*f;
}
const int maxn=1010,maxe=2000010,oo=2147483647;
struct Edge
{int u,v,w,next;Edge() {}Edge(int _1,int _2,int _3,int _4): u(_1),v(_2),w(_3),next(_4) {}
}e[maxe<<2];
int n,m,heng[maxn][maxn],shu[maxn][maxn],xie[maxn][maxn],first[maxe],ce=-1,s,t,all;
LL dis[maxe];
bool vis[maxe];
priority_queue <PLI,vector<PLI>,greater<PLI> > Q;
void addEdge(int a,int b,int c)
{if(a<0 || b<0)return;e[++ce]=Edge(a,b,c,first[a]);first[a]=ce;// printf("%d %d %d\n",a,b,c);
}
LL Dijkstra()
{for(int i=0;i<=all;i++)dis[i]=oo;dis[s]=0;Q.push(make_pair(0,s));while(Q.size()){int now=Q.top().second;Q.pop();if(vis[now])continue;vis[now]=1;for(int i=first[now];i!=-1;i=e[i].next)if(dis[now]+e[i].w<dis[e[i].v]){dis[e[i].v]=dis[now]+e[i].w;if(!vis[e[i].v])Q.push(make_pair(dis[e[i].v],e[i].v));}}return dis[t];
}
int main()
{mem(first,-1);n=read();m=read();for(int i=1;i<=n;i++)for(int j=1;j<m;j++)heng[i-1][j-1]=read();for(int i=1;i<n;i++)for(int j=1;j<=m;j++)shu[i-1][j-1]=read();for(int i=1;i<n;i++)for(int j=1;j<m;j++)xie[i-1][j-1]=read();n--;m--;s=2*n*m;t=s+1;all=t;for(int i=0;i<n;i++)addEdge(s,2*i*m+1,shu[i][0]);for(int i=0;i<m;i++)addEdge(s,2*(n*m-m+i)+1,heng[n][i]);for(int i=0;i<m;i++)addEdge(2*i,t,heng[0][i]);for(int i=0;i<n;i++)addEdge(2*(i*m+m-1),t,shu[i][m]);for(int i=0;i<n;i++)for(int j=0;j<m;j++){int num1=2*(m*i+j),num2=num1+1;if(j!=0)addEdge(num2,2*(m*i+j)-2,shu[i][j]);addEdge(num2,num1,xie[i][j]);if(i!=n-1)addEdge(num2,2*(m*(i+1)+j),heng[i+1][j]);addEdge(num1,num2,xie[i][j]);if(j!=m-1)addEdge(num1,2*(m*i+j)+3,shu[i][j+1]);if(i!=0)addEdge(num1,2*(m*(i-1)+j)+1,heng[i][j]);}printf("%lld\n",Dijkstra());return 0;
}