#include<cstdio>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
inline int read(){
	int x=0;
	int f=0,ch=0;
	while(ch<48||ch>57) f=(ch=='-'),ch=getchar();
	while(ch>47&&ch<58) x=(x<<3)+(x<<1)+(ch&15),ch=getchar();
	return f?-x:x;
}
inline void write(int x,char end=' '){
	if(x==0){
		putchar('0');
		putchar(end);
		return;
	}
	if(x<0) putchar('-'),x=-x;
	int ch[70]={0},cnt=0;
	while(x){
		ch[cnt++]=(int)(x%10);
		x/=10;
	}
	while(cnt--) putchar(ch[cnt]+48);
	putchar(end);
}
inline int max(int x,int y){return x>y?x:y;}
inline int min(int x,int y){return x<y?x:y;}
const int N=12;
int n,m;
int a[N][N],b[N][N];
int chess[N];
ll base[N];
map<ll,int> dp[2];
map<ll,bool> vis;
inline void init(){
	base[1]=1;
	for(int i=2;i<=10;++i) base[i]=base[i-1]*11;
	n=read(),m=read();
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			a[i][j]=read();
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			b[i][j]=read();
		}
	}
}
inline void dec(ll x){
	for(int i=1;i<=n;++i) chess[i]=0;
	int cnt=1;
	while(x){
		chess[cnt++]=x%11;
		x/=11;
	}
}
inline ll enc(){
	ll s=0;
	for(int i=1;i<=n;++i) s+=base[i]*chess[i];
	return s;
}
queue<ll> q;
inline void solve(){
	for(int i=1;i<=n;++i) chess[i]=m;
	ll state=enc();
	dp[0][state]=dp[1][state]=0;
	vis[state]=1;
	q.push(state);
	while(!q.empty()){
		state=q.front();
		q.pop();
		dec(state);
		for(int i=1;i<=n&&chess[i];++i){
			if(chess[i]<=chess[i+1]) continue;
			if(i==1&&chess[i]==1) return;
			if(!vis[state-base[i]]){
				dp[0][state-base[i]]=a[i][chess[i]]+dp[1][state];
				dp[1][state-base[i]]=-b[i][chess[i]]+dp[0][state];
				vis[state-base[i]]=1;
				q.push(state-base[i]);
			}
			else{
				dp[0][state-base[i]]=max(dp[0][state-base[i]],a[i][chess[i]]+dp[1][state]);
				dp[1][state-base[i]]=min(dp[1][state-base[i]],-b[i][chess[i]]+dp[0][state]);
			}
		}
	}
}
int main(){
	freopen("chess.in","r",stdin);
	freopen("chess.out","w",stdout);
	init();
	solve();
	write(a[1][1]+dp[1][enc()]);
	return 0;
}