#include <bits/stdc++.h>
using namespace std;


//TEMPLATE
#define pb                push_back
#define mp                make_pair
#define ll                int
#define ld                long double
#define pii               pair <ll, ll>
#define piii              pair <ll, pii>
#define F                 first
#define S                 second

#define newline           printf("\n")
#define minusone          printf("-1\n")
#define zeroo             printf("0\n")
#define scl1(a)           scanf("%lld", &a)
#define scl2(a, b)        scanf("%lld %lld", &a, &b)
#define scl3(a, b, c)     scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a)           printf("%lld\n", a)
#define prl2(a, b)        printf("%lld %lld\n", a, b)
#define ssl1(s)           scanf(" %[^\n]", s)
#define scd1(a)           scanf("%lf", &a)
#define scd2(a, b)        scanf("%lf %lf", &a, &b)
#define prd(a)            printf("%lf\n", a)
#define prld(a)           printf("%Lf\n", a)
#define prcase(cs)        printf("Case %lld: ", cs)
#define cin1(a)           cin >> a
#define cin2(a, b)        cin >> a >> b
#define cin3(a, b, c)     cin >> a >> b >> c
#define cin4(a, b, c, d)  cin >> a >> b >> c >> d
#define cot1(a)           cout << a << "\n"
#define cot2(a, b)        cout << a << " " << b << "\n"
#define cot3(a, b, c)     cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d)  cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline           cout << "\n"
#define cotminus          cout << "-1\n"
#define cot0              cout << "0\n"
#define cotyes            cout << "YES\n"
#define cotno             cout << "NO\n"
#define cotcase(cs)       cout << "Case " << cs << ": "

#define reversed(s)       reverse(s.begin(), s.end())
#define asort(s)          sort(s.begin(), s.end())
#define dsort(s)          sort(s.rbegin(), s.rend())
#define all(s)            s.begin(), s.end()
#define uniq(s)           s.resize(distance(s.begin(),unique(s.begin(), s.end())))
#define found(s, x)       (s.find(x) != s.end())

#define for0(i, n)        for (i = 0; i < n; i++)
#define for1(i, n)        for (i = 1; i <= n; i++)
#define fora(i, a, b)     for (i = a; i <= b; i++)
#define forb(i, b, a)     for (i = b; i >= a; i--)
#define fori(it, s)       for(auto it = s.begin(); it != s.end(); it++)

#define FR                ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ms(a, x)          memset(a, x, sizeof a)
#define bitcount(n)       __builtin_popcountll(n)

//#define pi              3.1415926536
#define pi                acos(-1)

const ll INF = 1e9;
const ll SZ = 80+2;
const ll mod = 1e9+7;


ll n, m;
ll a[SZ][SZ];
ll b[SZ][SZ];

bool dp[SZ][SZ][SZ*SZ][2];
//bool vis[SZ][SZ][SZ*SZ][2];

//bitset <2> dp[SZ][SZ][SZ*SZ];
//bitset <2> vis[SZ][SZ][SZ*SZ];


int main() {
    FR;
    ll cs = 0, tc = 1, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
//    ll a, b, d;
    string s, s1, s2;

//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);

    cin2(n, m);
    for1(i, n) for1(j, m) cin1(a[i][j]);
    for1(i, n) for1(j, m) cin1(b[i][j]);

    x = a[1][1] - b[1][1];
    y = b[1][1] - a[1][1];

    (x >= 0) ? dp[1][1][x][1] = 1 : dp[1][1][-x][0] = 1;
    (y >= 0) ? dp[1][1][y][1] = 1 : dp[1][1][-y][0] = 1;


    for1(i, n) {
        for1(j, m) {
            if(i == 1  && j == 1) continue;

            fora(x, -6400, 6400) {
                y = x;
                bool f = (y >= 0);
                if(y < 0) y = -y;

                ll d1 = a[i][j] - b[i][j];
                ll d2 = b[i][j] - a[i][j];

                ll v1 = y - d1;
                bool f1 = (v1 >= 0);
                if(v1 < 0) v1 = -v1;

                ll v2 = y - d2;
                bool f2 = (v2 >= 0);
                if(v2 < 0) v2 = -v2;

                if(i-1 >= 1) {
                    dp[i][j][y][f] |= dp[i-1][j][v1][f1];
                    dp[i][j][y][f] |= dp[i-1][j][v2][f2];
                }

                if(j-1 >= 1) {
                    dp[i][j][y][f] |= dp[i][j-1][v1][f1];
                    dp[i][j][y][f] |= dp[i][j-1][v2][f2];
                }
            }
        }
    }


    ans = INF;
    fora(i, -6400, 6400) {
        x = i;
        bool f = (i >= 0);
        if(x < 0) x = -x;
        if(dp[n][m][x][f]) ans = min(ans, x);
    }

    cot1(ans);

    return 0;
}

//3 3
//1 1 1
//2 2 2
//2 2 2
//1 1 1
//1 1 1
//1 2 2


Measured memory_bytes: 88024