import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto H = RD;
	auto W = RD;
	auto A = new long[][](H, W);
	auto B = new long[][](H, W);
	foreach (y; 0..H)
	{
		A[y] = RDA;
	}
	foreach (y; 0..H)
	{
		B[y] = RDA;
	}

	auto dp = new bool[][][](H, W, 160*(H+W));
	dp[0][0][A[0][0] - B[0][0] + 80*(H+W)] = true;
	dp[0][0][B[0][0] - A[0][0] + 80*(H+W)] = true;
	foreach (y; 0..H)
	{
		foreach (x; 0..W)
		{
			long d1, d2;
			if (y != H-1)
				d1 = A[y+1][x] - B[y+1][x];
			if (x != W-1)
				d2 = A[y][x+1] - B[y][x+1];
			foreach (key; 0..dp[y][x].length)
			{
				if (dp[y][x][key] == false) continue;
				debug writeln(y, ":", x, " ", cast(long)key - 80*(H+W));
				if (y != H-1)
				{
					dp[y+1][x][key+d1] = true;
					dp[y+1][x][key-d1] = true;
				}
				if (x != W-1)
				{
					dp[y][x+1][key+d2] = true;
					dp[y][x+1][key-d2] = true;
				}
			}
		}
	}

	long ans = long.max;
	foreach (key; 0..dp[H-1][W-1].length)
	{
		if (dp[H-1][W-1][key] == false) continue;
		ans.chmin(abs(cast(long)key - 80*(H+W)));
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}