#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
using ll = long long;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

int main(){
  int h = in();
  int w = in();
  vvector<int> vals(h,vector<int>(w));
  foreach(i,vals)foreach(j,i)j=in();
  foreach(i,vals)foreach(j,i)j=abs(j-in());
  int KMAX = (max(h,w)+2)*80;
  auto isin = [&](int y,int x,int k){
                return min({y,x,k})>= 0 and max({h-y,w-x,KMAX-k})<0;
              };
  auto neighbors = [&](int y,int x){
                     vector<pii> res;
                     if(y+1<h)res.emplace_back(y+1,x);
                     if(x+1<w)res.emplace_back(y,x+1);
                     return res;
                   };
  vvvector<bool> dp(h,vvector<bool>(w,vector<bool>(KMAX,false)));
  dp[0][0][vals[0][0]] = true;
  rep(y,h){
    rep(x,w){
      rep(k,KMAX){
        if(!dp[y][x][k])continue;
        foreach(np,neighbors(y,x)){
          int nx = np.second;
          int ny = np.first;
          for(int l=-1;l<=1;l+=2){
            int v = abs(k+l*vals[ny][nx]);
            if(v<KMAX){
              dp[ny][nx][v] = true;
            }
          }
        }
      }
    }
  }
  rep(i,KMAX){
    if(dp[h-1][w-1][i]){
      cout << i << endl;
      return 0;
    }
  }
  return 0;
}


Measured memory_bytes: 5760