#include<iostream>

#include<cstdio>

#include<cstring>

#include<map>

using namespace std;

typedef long long ll;

map<ll,ll>mp;

map<ll,bool>vis;

int n,m,s[][][],inf=1e9,cnt[];

ll pw(int a,int b)

{

    ll ret=;

    while(b){if(b&)ret*=a;a*=a;b>>=;}

    return ret;

}

ll dfs(ll x,bool f)

{

    if(vis[x])return mp[x];

    vis[x]=;mp[x]=-inf;ll tx=x;

//    for(int i=m;i;i--)cnt[i]=tx%(n+1),tx/=(n+1);

    if(cnt[m]==n)return mp[x]=;

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

    {

        if(cnt[i]==n||(i>&&cnt[i-]<=cnt[i]))continue;

        cnt[i]++;

        ll y=x+pw(n+,m-i);

        mp[x]=max(mp[x],s[f][cnt[i]][i]-dfs(y,!f));

        cnt[i]--;

    }

    return mp[x];

}

int main()

{

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

    for(int k=;k<=;k++)

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

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

                scanf("%d",&s[k][i][j]);

    printf("%lld",dfs(,));

}