#include <bits/stdc++.h>
#include <boost/algorithm/string/join.hpp>
#include <boost/range/irange.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using boost::irange;
using boost::algorithm::join;

typedef long long ll;
typedef unsigned long long ull;
//typedef long double ld;

typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int > > vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;

constexpr ll MOD = 1e9+7;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/4;
constexpr int INF=inf<int>;
constexpr ll LINF=inf<ll>;

#define Sort(x) sort(begin(x),end(x))
#define Reverse(x) reverse(begin(x),end(x))
#define ABS(a,b) ((a)<(b)?(b)-(a):(a)-(b))
#define nbit(n) (1ull<<(n))
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...) _ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define REPA(i,v) REP(i,(v).size())

// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置

// Returns minimum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmin(T& a, T b) {
  if (a > b) {
    a = b;
  }
  return a;
}

// Returns maximum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmax(T& a, T b) {
  if (a < b) {
    a = b;
  }
  return a;
}

template <typename T>
void dumpContents(const T& v, const string& msg)
{
  cerr << "### " << msg << " ###\n";
  for (const auto& x : v) {
    cerr << x << " ";
  }
  cerr << endl;
}

struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(20)<<fixed;
    #define endl "\n"
  }
} before_main_function;

// ========== end of template ==========
constexpr int HW_MAX=80;
int H, W;
int A[HW_MAX][HW_MAX] = {{0}};
int B[HW_MAX][HW_MAX] = {{0}};

unordered_set<int> dp[HW_MAX][HW_MAX];

int main(int argc, char** argv) {
  cin >> H >> W;
  REP(i, H) {
    REP(j, W) {
      cin >> A[i][j];
    }
  }
  REP(i, H) {
    REP(j, W) {
      cin >> B[i][j];
    }
  }

  int SUM_MAX = 80*2*HW_MAX+1;
  vector<vector<bool> > prev(W, vector<bool>(SUM_MAX));

  REP(i, H) {
    vector<vector<bool> > curr(W, vector<bool>(SUM_MAX));

    REP(j, W) {
      int xs[2] = {A[i][j]-B[i][j], -A[i][j]+B[i][j]};
      if (i==0 && j==0) {
        curr[j][ABS(xs[0],0)] = true;
	continue;
      }

      // 上から
      REP(l, SUM_MAX) {
        if (!prev[j][l]) continue;
        REP(k, 2) {
          int x = ABS(l + xs[k], 0);
          curr[j][x] = true;
        }
      }

      // 左から
      if (j==0) continue;
      REP(l, SUM_MAX) {
        if (!curr[j-1][l]) continue;
        REP(k, 2) {
          int x = ABS(l + xs[k], 0);
          curr[j][x] = true;
        }
      }
    }

    prev.swap(curr);
  }

  REP(l, SUM_MAX) {
    if (prev[W-1][l]) {
      cout << l << endl;
      break;
    }
  }

  return 0;
}


Measured memory_bytes: 896