/*

  "With age, comes wisdom. With travel, comes understanding.
   Remember that happiness is a way of travel – not a destination"

*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define int            int
#define ld             long double
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl

inline int power(int a, int b)
{
     int x = 1;
     while (b)
     {
          if (b & 1) x *= a;
          a *= a;
          b >>= 1;
     }
     return x;
}

typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> Set;

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
     const char* comma = strchr (names + 1, ',');
     cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 81;
const int M = 20000;
int a[N][N], n, m, k;
bool dp[N][N][2 * M + 5];

void solve()
{
     int i, j;
     cin >> n >> m;
     for (i = 1; i <= n; i++)
          for (j = 1; j <= m; j++)
               cin >> a[i][j];
     for (i = 1; i <= n; i++)
          for (j = 1; j <= m; j++)
          {
               int x; cin >> x;
               a[i][j] -= x;
          }

     dp[1][1][M + a[1][1]] = 1;
     dp[1][1][M - a[1][1]] = 1;

     for (i = 1; i <= n; i++)
          for (j = 1; j <= m; j++)
               for (int k = 0; k <= 2 * M; k++)
                    if (dp[i][j][k])
                    {
                         if (i + 1 <= n)
                         {
                              dp[i + 1][j][k + a[i + 1][j]] = 1;
                              dp[i + 1][j][k - a[i + 1][j]] = 1;
                         }
                         if (j + 1 <= m)
                         {
                              dp[i][j + 1][k + a[i][j + 1]] = 1;
                              dp[i][j + 1][k - a[i][j + 1]] = 1;
                         }
                    }

     int ans = 1e9;
     for (i = 0; i <= 2 * M; i++)
          if (dp[n][m][i])
               ans = min(abs(i - M), ans);

     cout << ans;

}

int32_t main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

     cout << setprecision(9) << fixed;
     clock_t z = clock();
     solve();
     cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

     return 0;
}


Measured memory_bytes: 254464