#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=2000010;
const int mod=998244353;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned long long ull;
int tot,u[N],v[6*N],w[6*N],pre[6*N],q[N],dis[N];
void add(int a,int b,int c) {
v[tot]=b;w[tot]=c;pre[tot]=u[a];u[a]=tot++;
v[tot]=a;w[tot]=c;pre[tot]=u[b];u[b]=tot++;
}
struct node {
int x,y;
node(){}
node(int x,int y):x(x),y(y){}
bool operator < (const node a) const {
return x>a.x;
}
};
priority_queue<node>Q;
int main()
{
node top;
int a,i,j,n,m,S,T;
scanf("%d%d", &n, &m);
if (n==1||m==1) {
for (S=INF,i=1;i<max(n,m);i++) {
scanf("%d", &a);S=min(S,a);
}
printf("%d\n", S);return 0;
}
memset(u,-1,sizeof(u));
tot=S=0;T=2*(n-1)*(m-1)+1;
for (i=1;i<=n;i++)
for (j=1;j<m;j++) {
scanf("%d", &a);
if (i==1) add(S,2*j,a);
else if (i==n) add(T,2*(i-2)*(m-1)+2*j-1,a);
else add(2*(i-2)*(m-1)+2*j-1,2*(i-1)*(m-1)+2*j,a);
}
for (i=1;i<n;i++)
for (j=1;j<=m;j++) {
scanf("%d", &a);
if (j==1) add(T,2*(i-1)*(m-1)+1,a);
else if (j==m) add(S,2*i*(m-1),a);
else add(2*(i-1)*(m-1)+2*j-2,2*(i-1)*(m-1)+2*j-1,a);
}
for (i=1;i<n;i++)
for (j=1;j<m;j++) {
scanf("%d", &a);
add(2*(i-1)*(m-1)+2*j-1,2*(i-1)*(m-1)+2*j,a);
}
memset(q,0,sizeof(q));
memset(dis,0x3f,sizeof(dis));
dis[S]=0;Q.push(node(0,S));
while (!Q.empty()) {
top=Q.top();Q.pop();
if (q[top.y]) continue ;
for (q[top.y]=1,i=u[top.y];i!=-1;i=pre[i])
if (!q[v[i]]&&dis[v[i]]>top.x+w[i]) {
dis[v[i]]=top.x+w[i];Q.push(node(dis[v[i]],v[i]));
}
}
printf("%d\n", dis[T]);
return 0;
}