#pragma GCC target ("avx")
#pragma GCC optimize ("tree-vectorize")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using ulint = unsigned long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;
int main()
{
    const lint INF = 1000000007;
    const lint MAX = 80*160 + 1;
    lint h,w;
    cin >> h >> w;
    vector<vector<lint>> a(h,vector<lint>(w)),b(h,vector<lint>(w));
    vector<vector<vector<bool>>> dp(h + 1,vector<vector<bool>>(w + 1,vector<bool>(MAX)));
    REP(i,h){
        REP(j,w){
            lint t;
            cin >> t;
            a[i][j] = t;;
        }
    }
    REP(i,h){
        REP(j,w){
            lint u;
            cin >> u;
            b[i][j] = u;
        }
    }
    REP(i,h + 1){
        REP(j,w + 1){
            REP(k,MAX){
                dp[i][j][k] = false;
            }
        }
    }
    dp[0][1][0] = true;
    dp[1][0][0] = true;
    //dp[1][1][abs(a[0][0]-b[0][0])] = true;
    FOR(i,1,h + 1){
        FOR(j,1,w + 1){
            REP(k,MAX){
                dp[i][j][k + abs(a[i-1][j-1] - b[i-1][j-1])] = dp[i][j][k + abs(a[i-1][j-1] - b[i-1][j-1])] | dp[i-1][j][k];
                dp[i][j][abs(k - abs(a[i-1][j-1] - b[i-1][j-1]))] = dp[i][j][abs(k - abs(a[i-1][j-1] - b[i-1][j-1]))]  | dp[i-1][j][k];
                dp[i][j][k + abs(a[i-1][j-1] - b[i-1][j-1])] = dp[i][j][k + abs(a[i-1][j-1] - b[i-1][j-1])] | dp[i][j-1][k];
                dp[i][j][abs(k - abs(a[i-1][j-1] - b[i-1][j-1]))] = dp[i][j][abs(k - abs(a[i-1][j-1] - b[i-1][j-1]))] | dp[i][j-1][k];
            }
        }
    }
    REP(i,MAX){
        if(dp[h][w][i]){
            cout << i << endl;
            return 0;
        }
    }
    cout << 0 << endl;
    //return 0;
}

Measured memory_bytes: 11136