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

    Problem: 1001

    User: 96655

    Language: C++

    Result: Accepted

    Time:1724 ms

    Memory:95120 kb

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

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<string>

#include<iostream>

#include<cstdlib>

#include<queue>

#include<map>

#include<set>

#include<vector>

#include<cmath>

#include<stack>

#include<utility>

using namespace std;

const int maxn=;

const int INF=0x3f3f3f3f;

struct Edge

{

    int v,w,next;

} edge[maxn*];

int head[maxn*],p,n,m,y;

void addedge(int u,int v,int w)

{

    edge[p].w=w;

    edge[p].v=v;

    edge[p].next=head[u];

    head[u]=p++;

}

struct asd

{

    int x,d;

    asd (int a,int b):x(a),d(b) {}

    bool operator<(const asd &e)const

    {

        return d>e.d;

    }

};

priority_queue<asd>q;

int dis[maxn*],vis[maxn*];

void Dijkstra(int s)

{

    memset(vis,,sizeof(vis));

    while(!q.empty())q.pop();

    for(int i=; i<=y; i++)

        dis[i]=INF;

    dis[s]=;

    q.push(asd(s,));

    while(!q.empty())

    {

        asd e=q.top();

        q.pop();

        if(vis[e.x])continue;

        vis[e.x]=;

        for(int i=head[e.x]; i!=-; i=edge[i].next)

        {

            int v=edge[i].v;

            if(dis[v]>dis[e.x]+edge[i].w)

            {

                dis[v]=dis[e.x]+edge[i].w;

                q.push(asd(v,dis[v]));

            }

        }

    }

}

void read(int &x)

{

    char c;

    while((c=getchar())<'' || c>'');

    x=c-'';

    while((c=getchar())>='' && c<='') x=(x<<)+(x<<)+c-'';

}

int main()

{

    read(n);

    read(m);

    if(n==||m==)

    {

        if(n>m)swap(n,m);

        int ans=INF,a;

        for(int i=; i<m; i++)

        {

            scanf("%d",&a);

            ans=min(a,ans);

        }

        if(ans==INF)printf("0\n");

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

        return ;

    }

    memset(head,-,sizeof(head));

    p=;

    y=(n-)*(m-)*+;

    int w,u,v;

    for(int i=; i<=n; i++)

    {

        for(int j=; j<m; j++)

        {

            read(w);

            if(i==)

            {

                u=((i-)*(m-)+j)*;

                addedge(u,y,w);

                addedge(y,u,w);

            }

            else if(i==n)

            {

                u=((i-)*(m-)+j)*-;

                addedge(,u,w);

            }

            else

            {

                u=((i-)*(m-)+j)*;

                v=((i-)*(m-)+j)*-;

                addedge(u,v,w);

                addedge(v,u,w);

            }

        }

    }

    for(int i=; i<n; i++)

    {

        for(int j=; j<=m; j++)

        {

            read(w);

            if(j==)

            {

                u=((i-)*(m-)+j)*-;

                addedge(,u,w);

                addedge(u,,w);

            }

            else if(j==m)

            {

                u=((i-)*(m-)+j-)*;

                addedge(u,y,w);

                addedge(y,u,w);

            }

            else

            {

                u=((i-)*(m-)+j)*-;

                v=((i-)*(m-)+j-)*;

                addedge(u,v,w);

                addedge(v,u,w);

            }

        }

    }

    for(int i=; i<n; i++)

    {

        for(int j=; j<m; j++)

        {

            read(w);

            u=((i-)*(m-)+j)*-;

            v=((i-)*(m-)+j)*;

            addedge(u,v,w);

            addedge(v,u,w);

        }

    }

    Dijkstra();

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

    return ;

}