// bzoj1001

#include<algorithm>

#include<iostream>

#include<cstring>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<queue>

#define LL long long

#define inf 2147483640

#define MOD 10000

#define Pi acos(-1.0)

#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);

using namespace std;

const int maxn=1000010;

struct edge {int to,next,w;}e[maxn<<3];

int head[maxn],d[maxn],ans;

int n,m,cnt=1;

void link(int u,int v,int w) {

	e[++cnt]=(edge){v,head[u],w};head[u]=cnt;

	e[++cnt]=(edge){u,head[v],w};head[v]=cnt;

}

bool bfs() {

	memset(d,-1,sizeof(d));

	queue<int> q;q.push(1);d[1]=0;

	while (!q.empty()) {

		int x=q.front();q.pop();

		for (int i=head[x];i;i=e[i].next) if (e[i].w && d[e[i].to]<0) {

				q.push(e[i].to);

				d[e[i].to]=d[x]+1;

			}

	}

	return d[n*m]<0 ? 0 : 1;

}

int dfs(int x,int f) {

	if (x==n*m || f==0) return f;

	int w,used=0;

	for (int i=head[x];i;i=e[i].next) if (e[i].w && d[e[i].to]==d[x]+1) {

			w=dfs(e[i].to,min(f-used,e[i].w));

			e[i].w-=w;e[i^1].w+=w;

			used+=w;

			if (used==f) return f;

		}

	if (!used) d[x]=-1;  //关键优化

	return used;

}

void Dinic(int s) {

	while (bfs()) ans+=dfs(s,inf);

}

int main() {

	int x;scanf("%d%d",&n,&m);

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

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

			scanf("%d",&x);

			link(m*(i-1)+j,m*(i-1)+j+1,x);

		}

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

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

			scanf("%d",&x);

			link(m*(i-1)+j,m*i+j,x);

		}

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

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

			scanf("%d",&x);

			link(m*(i-1)+j,m*i+j+1,x);

		}

	Dinic(1);

	printf("%d",ans);

    return 0;

}