/**************************************************************

     Problem: 1001

     User: Tunix

     Language: C++

     Result: Accepted

     Time:3012 ms

     Memory:121388 kb

 ****************************************************************/

 //BZOJ 1001

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*sign;

 }

 const int N=3e6+,M=6e6+,INF=~0u>>;

 typedef long long LL;

 /******************tamplate*********************/

 int head[N],next[M],to[M],len[M],cnt;

 void ins(int x,int y,int z){

     to[++cnt]=y; next[cnt]=head[x]; head[x]=cnt; len[cnt]=z;

 }

 void add(int x,int y,int z){ins(x,y,z);ins(y,x,z);}

 /********************edge***********************/

 int n,m;

 inline int pack(int i,int j){return i*(m<<)+j;}

 int Q[M],d[N];

 bool inq[N];

 int spfa(int S,int T){

     int l=,r=;

     Q[++r]=S;

     memset(d,0x7f,sizeof d);

     memset(inq,,sizeof inq);

     d[S]=;

     while(l!=r){

         int x=Q[l++];

         if (l==M) l=;

         inq[x]=;

         for(int i=head[x];i;i=next[i])

             if (d[to[i]]>d[x]+len[i]){

                 d[to[i]]=d[x]+len[i];

                 if (!inq[to[i]]){

                     r++; if(r==M) r=;

                     Q[r]=to[i];

                     inq[to[i]]=;

                 }

             }

     }

     return d[T];

 }

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1001.in","r",stdin);

     freopen("1001.out","w",stdout);

 #endif

     n=getint(); m=getint();

     int x;

     F(i,,n) F(j,,m-){

         x=getint();

         add(pack(i-,j<<),pack(i,j<<|),x);

     }

     F(i,,n-) F(j,,m){

         x=getint();

         add(pack(i,(j<<)-),pack(i,j<<),x);

     }

     F(i,,n-) F(j,,m-){

         x=getint();

         add(pack(i,j<<),pack(i,j<<|),x);

     }

 //  if (n==1) {solve1(); return 0;}

     int S=,T=pack(n,m<<);

     F(j,,m-){

         add(S,pack(,j<<),);

         add(pack(n,j<<|),T,);

     }

     F(i,,n-){

         add(pack(i,),T,);

         add(S,pack(i,m<<),);

     }

     int ans=spfa(S,T);

 //  printf("%d\n",ans);

     cout<<ans<<endl;

     return ;

 }