Problem:
Score : 500 points

Problem Statement

We have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.

The square (i, j) has two numbers A_{ij} and B_{ij} written on it.

First, for each square, Takahashi paints one of the written numbers red and the other blue.

Then, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.

Let the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).

Takahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.

Find the minimum unbalancedness possible.

Constraints

2 \leq H \leq 80

2 \leq W \leq 80

0 \leq A_{ij} \leq 80

0 \leq B_{ij} \leq 80

All values in input are integers.

Input

Input is given from Standard Input in the following format:

H W
A_{11} A_{12} \ldots A_{1W}
:
A_{H1} A_{H2} \ldots A_{HW}
B_{11} B_{12} \ldots B_{1W}
:
B_{H1} B_{H2} \ldots B_{HW}

Output

Print the minimum unbalancedness possible.

Sample Input 1

2 2
1 2
3 4
3 4
2 1

Sample Output 1

0

By painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.

Sample Input 2

2 3
1 10 80
80 10 1
1 2 3
4 5 6

Sample Output 2

2

Solution in LuaJIT (2.0.4) (judge verdict: Time Limit Exceeded)

local mmi = math.min
local h, w = io.read("*n", "*n")
local a = {}
for i = 1, h do
  for j = 1, w do
    a[(i - 1) * w + j] = io.read("*n")
  end
end
for i = 1, h do
  for j = 1, w do
    local idx = (i - 1) * w + j
    a[idx] = a[idx] - io.read("*n")
  end
end

-- top
local map = {}
for i = 1, h * w do map[i] = {} end
for i = 1, 161 do map[1][i] = false end
map[1][81 + a[1]] = true
map[1][81 - a[1]] = true
for j = 2, w do
  local av = a[j]
  local lim = 80 * j
  for p = -lim, lim do
    local dst = p + lim + 1
    map[j][dst] = false
    local src = dst - 80
    if av < src and map[j - 1][src - av] then
      map[j][dst] = true
    end
    if src + av <= lim * 2 - 159 and map[j - 1][src + av] then
      map[j][dst] = true
    end
  end
end
-- left
for i = 2, h do
  local idx = (i - 1) * w + 1
  local av = a[idx]
  local lim = 80 * i
  for p = -lim, lim do
    local dst = p + lim + 1
    local src = dst - 80
    map[idx][dst] = false
    if av < src and map[idx - w][src - av] then
      map[idx][dst] = true
    end
    if src + av <= lim * 2 - 159 and map[idx - w][src + av] then
      map[idx][dst] = true
    end
  end
end
local mmi = math.min
-- rem
for i = 2, h do
  for j = 2, w do
    local idx = (i - 1) * w + j
    local av = a[idx]
    local lim = mmi(6400, (i + j - 1) * 80) * 2 + 1
    -- if 6400 < lim then lim = 6400 end
    for dst = 1, lim do
    -- for p = -lim, lim do
      -- local dst = p + lim + 1
      local src = dst - 80
      local f = false
      if av < src then
        if map[idx - w][src - av] or map[idx - 1][src - av] then
          f = true
        end
      end
      if not f and src + av <= lim - 160 then
      -- if src + av <= lim * 2 - 159 then
        if map[idx - w][src + av] or map[idx - 1][src + av] then
          f = true
        end
      end
      map[idx][dst] = f
    end
  end
end
local ret = 1000000007
local mab = math.abs
do
  local lim = (h + w - 1) * 80
  for p = -lim, lim do
    if map[h * w][p + lim + 1] then
      if mab(p) < ret then
        ret = mab(p)
      end
    end
  end
end
print(ret)