/// __Macro's__
// #pragma GCC optimize("-O0")
#include <bits/stdc++.h>
using namespace std;
#define ll                   long long
#define II                   pair<int,int>
#define III                  pair<int, II>
#define VI                   vector<int>
#define VII                  vector<II>
#define VIII                 vector<III>
#define VVI                  vector<vector<int> >
#define VVII                 vector<vector<II> >
#define fr                   first
#define sc                   second
#define mkpr                 make_pair
#define PQ                   priority_queue
#define pb                   push_back
#define eb                   emplace_back
#define all(v)               v.begin(), v.end()
#define LINE                 putc('\n', stdout)
#define SPACE                putc(' ' , stdout)
#define TAB                  putc('\t', stdout)
#define fillarr(arr, val)    fill((int*)arr, (int*)arr+(sizeof(arr)/sizeof(int)), val)
#define Log2(x)              (31^__builtin_clz(x))
#define inf                  1000000007 
#define MOD                  1000000007 
#define getint ReadInt()
const char IO_MODE = 3; // in-->00<--out (MSB-->LSB) | 0: Norm, 1: Fast 
inline ll ReadInt(){ll x=0,s=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';
c=getchar();}return s*x;}inline void WriteInt(ll x){char c[20];if(!x){putchar('0');return;}if(x<0)putchar('-'),x=-x;int i=0;while(x>0)
c[++i]=x%10,x/=10;while(i)putchar(c[i--]+48);}template <typename T>inline void out(T x){if(IO_MODE&1)WriteInt(x);else if(typeid(x)==typeid(int))
printf("%i", x);else printf("%lld", (ll)x);}template<typename T, typename... Args>inline void out(T x,Args...args){out(x);SPACE;out(args...);}
template <typename T>inline void in(T &x){if(IO_MODE&2) x=ReadInt();else if(typeid(x)==typeid(int))scanf("%i",&x);else if(typeid(x)==typeid(ll))
scanf("%lld",&x);}template<typename T, typename... Args>inline void in(T &x,Args&...args){in(x);in(args...);}
int aa,bb,cc,dd,ee,ff,gg,hh,ii,jj,kk,mm,nn,oo,pp,qq,rr,ss,tt,uu,vv,ww,xx,yy,zz;
int tc;
///
/// ---------------------------------------------- (Debug) -----------------------------------------------
#define dbg debug()
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i));}
sim, class b dor(pair < b, c > d) {ris << "(" << d.first << ", " << d.second << ")";}
sim dor(rge<c> d) {*this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]";}
#else
sim dor(const c&) { ris; }
#endif
};
#define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
/// ------------------------------------------------------------------------------------------------------

#ifdef LOCAL
	#define nax 1000
	#define qax 1000
#else
	#define nax 300100
	#define qax 100100
#endif

int n,m;
int A[82][82];

int memo[82][82][2*82*82];
int dp(int i, int j, int sum)
{
	dbg << var(i) var(j) var(sum);
	if(i==n-1 && j==m-1) return abs(sum-A[i][j]);
	if(memo[i][j][sum]!=-1) return memo[i][j][sum];

	int ret = inf;
	if(i+1<n) {

		ret = min(ret, dp(i+1, j, abs(sum-A[i][j]) ));
		ret = min(ret, dp(i+1, j, abs(sum+A[i][j]) ));
	}
	if(j+1<m){
		ret = min(ret, dp(i, j+1, abs(sum-A[i][j]) ));
		ret = min(ret, dp(i, j+1, abs(sum+A[i][j]) ));
	}

	return memo[i][j][sum] = ret;
}

int main()
{
	in(n,m);
	for(int i=0 ; i<n ; i++)
		for(int j=0 ; j<m ; j++)
			A[i][j] = getint;

	for(int i=0 ; i<n ; i++)
		for(int j=0 ; j<m ; j++)
			A[i][j] = abs(A[i][j] - getint);

	memset(memo, -1, sizeof memo);
	cout << dp(0, 0, 0) << endl;		
}

Measured memory_bytes: 353536