#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

constexpr int max_s = 80 * 160;
constexpr int max_v = 80 * 160 * 2;

bool dp[80][80][max_v+10];

int index(int x){
    return x + 80 * 160;
}

int main(){
    int h,w; cin >> h >> w;
    vvi a(h,vi(w)), b(h,vi(w));
    rep(i,h) rep(j,w) cin >> a[i][j];
    rep(i,h) rep(j,w) cin >> b[i][j];
    vvi c(h,vi(w));
    rep(i,h) rep(j,w) c[i][j] = abs(a[i][j]-b[i][j]);

    dp[0][0][index(c[0][0])] = true;
    dp[0][0][index(-c[0][0])] = true;
    rep(i,h){
        rep(j,w){
            for(int k=-80*160;k<=80*160;k++){
                if(i-1>=0 && k-c[i][j]>=-max_s) dp[i][j][index(k)] |= dp[i-1][j][index(k-c[i][j])];
                if(i-1>=0 && k+c[i][j]<=max_s) dp[i][j][index(k)] |= dp[i-1][j][index(k+c[i][j])];
                if(j-1>=0 && k-c[i][j]>=-max_s) dp[i][j][index(k)] |= dp[i][j-1][index(k-c[i][j])];
                if(j-1>=0 && k+c[i][j]<=max_s) dp[i][j][index(k)] |= dp[i][j-1][index(k+c[i][j])];
            }
        }
    }

    /* rep(i,h){ */
    /*     rep(j,w){ */
    /*         cout << c[i][j] << " "; */
    /*     } */
    /*     cout << endl; */
    /* } */

    /* rep(i,h){ */
    /*     rep(j,w){ */
    /*         set<int> st; */
    /*         for(int k=-max_s;k<=max_s;k++){ */
    /*             if(dp[i][j][index(k)]){ */
    /*                 st.insert(k); */
    /*             } */
    /*         } */
    /*         cout << st << " "; */
    /*     } */
    /*     cout << endl; */
    /* } */

    ll ans = max_s+100;
    for(int k=-max_s;k<=max_s;k++){
        if(dp[h-1][w-1][index(k)]){
            ans = min(ans,abs((ll)k));
        }
    }
    cout << ans << endl;
}


Measured memory_bytes: 160384