#include<bits/stdc++.h>

using namespace std;

#define il inline

//#define int long long

#define fi first

#define sc second

#define gc getchar()

#define mp make_pair

#define P pair<int,int>

#define t(i) edge[i].to

#define w(i) edge[i].wei

#define ri register int

#define rb register bool

#define rc register char

#define rp(i,x,y) for(ri i=x;i<=y;++i)

#define my(i,x,y) for(ri i=x;i>=y;--i)

#define e(i,x) for(ri i=head[x];i;i=edge[i].nxt)

const int N=+;

int n,m,ed_cnt,head[N*N],S,T,dis[N*N];

struct ed{int to,nxt,wei;}edge[N*N*];

bool vis[N*N];

il int read()

{

    rc ch=gc;ri x=;rb y=;

    while(ch!='-' && (ch>'' || ch<''))ch=gc;

    if(ch=='-')ch=gc,y=;

    while(ch>='' && ch<='')x=(x<<)+(x<<)+(ch^''),ch=gc;

    return y?x:-x;

}

il void ad(ri x,ri y,ri z){/*printf("%d -> %d : %d\n",y,x,z);*/edge[++ed_cnt]=(ed){x,head[y],z};head[y]=ed_cnt;}

il int nam(ri x,ri y,ri z){if(!x)return T;if(y>m)return T;if(!y)return S;if(x>n)return S;return (x*m-m+y)*+z;}

il void dij()

{

    priority_queue< P,vector<P>,greater<P> >Q;Q.push(mp(,S));memset(dis,,sizeof(dis));

    while(!Q.empty())

    {

        ri nw=Q.top().sc,diss=Q.top().fi;Q.pop();if(vis[nw])continue;vis[nw]=;dis[nw]=diss;

        e(i,nw)if(!vis[t(i)])Q.push(mp(dis[nw]+w(i),t(i)));

    }

}

int main()

{

    //freopen("4001.in","r",stdin);freopen("4001.out","w",stdout);

    n=read()-;m=read()-;S=;T=n*m*+;

    rp(i,,n+){rp(j,,m){ri tmp=read(),pos1=nam(i,j,-),pos2=nam(i-,j,);/*printf("%d ",tmp);*/ad(pos1,pos2,tmp);ad(pos2,pos1,tmp);}/*printf("\n");*/}

    //printf("---\n");

    rp(i,,n){rp(j,,m+){ri tmp=read(),pos1=nam(i,j,),pos2=nam(i,j-,-);/*printf("%d ",tmp);*/ad(pos1,pos2,tmp);ad(pos2,pos1,tmp);}/*printf("\n");*/}

    //printf("---\n");

    rp(i,,n){rp(j,,m){ri tmp=read(),pos1=nam(i,j,-),pos2=nam(i,j,);/*printf("%d ",tmp);*/ad(pos1,pos2,tmp);ad(pos2,pos1,tmp);}/*printf("\n");*/}

    //printf("---\n");

    //printf("---------\n");

    //rp(i,1,n-1)rp(j,1,m-1)printf("%d %d (%d,%d)\n",nam(i,j,0),nam(i,j,-1),i,j);

    dij();printf("%d\n",dis[T]);

    return ;

}

//if(m==1 || n==1) tepan!!!