#include<bits/stdc++.h>
using namespace std;

const int N=10,M=1024+100,INF=1e9;
int in(int S,int x){ return (S>>x)&1; }

int n,m,mp[2][N][N];

int f[M][M];
int dfs(int X,int Y,int peo){
	int &res=f[X][Y];
	if(res!=INF+1) return res; res=-INF;
	int mpx[N],mpy[N];
	int cnt=0; for(int i=0;i<n;i++) if(in(X,i)) mpx[++cnt]=i;
	cnt=0; for(int i=m-1;i>=0;i--) if(in(Y,i)) mpy[++cnt]=i;
	for(int i=1;i<=cnt;i++){
		int NX=X^(1<<mpx[i]),NY=Y^(1<<mpy[i]);
		if(mpx[i]+1<n&&!in(NX,mpx[i]+1)) NX^=(1<<(mpx[i]+1)),NY^=(1<<mpy[i]);
		if(mpy[i]+1<m&&!in(NY,mpy[i]+1)) NY^=(1<<(mpy[i]+1)),NX^=(1<<mpx[i]);
		dfs(NX,NY,peo^1);
		res=max(res,mp[peo][mpx[i]][mpy[i]]-f[NX][NY]);
	}
	return res;
}

int main(){
	
//	freopen("data.out","r",stdin);
//	freopen("Elaina.out","w",stdout);

	scanf("%d %d", &n, &m);
	for(int i=0;i<n;i++) for(int j=0;j<m;j++) scanf("%d", &mp[1][i][j]);
	for(int i=0;i<n;i++) for(int j=0;j<m;j++) scanf("%d", &mp[0][i][j]);
	
	for(int i=0;i<(1<<n);i++) for(int j=0;j<(1<<m);j++) f[i][j]=INF+1;
	f[0][0]=0;
	
	printf("%d\n", dfs(1,1,1));
	
	return 0;
}