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 Haskell (GHC 8.8.3) (judge verdict: Wrong Answer)

import Data.Array
import Control.Monad

main = do
    [h, w] <- map read <$> words <$> getLine
    a <- listArray (1, h) <$> (forM [1 .. h] $ \_ -> listArray (1, w) <$> map read <$> words <$> getLine)
    b <- listArray (1, h) <$> (forM [1 .. h] $ \_ -> listArray (1, w) <$> map read <$> words <$> getLine)
    putStrLn $ show $ solve h w a b

solve :: Int -> Int -> Array Int (Array Int Int) -> Array Int (Array Int Int) -> Int
solve h w a b = minimum $ filter (\v -> dp ! (h, w, v)) $ [0 .. maxv]
  where
    dp = listArray ((1, 1, 0), (h, w, maxv)) [doit y x v | y <- [1 .. h], x <- [1 .. w], v <- [0 .. maxv]]
    doit 1 1 v = v == abs (a ! 1 ! 1 - b ! 1 ! 1)
    doit y x v = ((x > 1 && v1 >= 0 && v1 <= maxv && dp ! (y, x - 1, v1)) ||
                  (x > 1 && v2 >= 0 && v2 <= maxv && dp ! (y, x - 1, v2)) ||
                  (y > 1 && v1 >= 0 && v1 <= maxv && dp ! (y - 1, x, v1)) ||
                  (y > 1 && v2 >= 0 && v2 <= maxv && dp ! (y - 1, x, v2)))
      where
        v1 = abs (v - a ! y ! x + b ! y ! x)
        v2 = abs (v + a ! y ! x - b ! y ! x)
    maxv = 80 * 4