//minamoto

 #include<cstdio>

 #include<iostream>

 #include<map>

 #define ll long long

 using namespace std;

 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)

 char buf[<<],*p1=buf,*p2=buf;

 template<class T>inline bool cmax(T&a,const T&b){return a<b?a=b,:;}

 template<class T>inline bool cmin(T&a,const T&b){return a>b?a=b,:;}

 inline int read(){

     #define num ch-'0'

     char ch;bool flag=;int res;

     while(!isdigit(ch=getc()))

     (ch=='-')&&(flag=true);

     for(res=num;isdigit(ch=getc());res=res*+num);

     (flag)&&(res=-res);

     #undef num

     return res;

 }

 const int N=,base=,inf=0x3f3f3f3f;

 map<ll,int> mp;int a[N][N],b[N][N],bl[N],n,m;

 inline ll hsh(){

     ll res=;

     for(int i=;i<=n;++i) res=res*base+bl[i];

     return res;

 }

 inline void unzip(ll S){

     for(int i=n;i;--i) bl[i]=S%base,S/=base;

 }

 inline int getnxt(){

     int res=;

     for(int i=;i<=n;++i) res+=bl[i];

     return res&;

 }

 int dfs(ll S){

     if(mp.find(S)!=mp.end()) return mp[S];

     unzip(S);

     int type=getnxt(),res=type?inf:-inf;

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

     if(bl[i-]>bl[i]){

         ++bl[i];ll h=hsh();

         type?cmin(res,dfs(h)-b[i][bl[i]]):cmax(res,dfs(h)+a[i][bl[i]]);

         --bl[i];

     }

     return mp[S]=res;

 }

 int main(){

 //    freopen("testdata.in","r",stdin);

     n=read(),m=read(),bl[]=m;

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

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

     a[i][j]=read();

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

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

     b[i][j]=read();

     for(int i=;i<=n;++i) bl[i]=m;

     ll full=hsh();mp[full]=;

     dfs();

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

     return ;

 }