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 Rust (1.15.1) (judge verdict: Wrong Answer)

#[macro_use]
mod input_mcr {
    // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
    // diff: using Parser
    #[macro_export(local_inner_macros)]
    macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

    #[macro_export(local_inner_macros)]
    macro_rules! input_inner {
    ($parser:ident) => {};
    ($parser:ident, ) => {};
    ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($parser, $t);
        input_inner!{$parser $($r)*}
    };
}

    #[macro_export(local_inner_macros)]
    macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, char_) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()[0]
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, i64_) => {
        $parser.fast_i64()
    };
    ($parser:ident, usize_) => {
        $parser.fast_i64() as usize
    };
    ($parser:ident, usize1_) => {
        ($parser.fast_i64() - 1) as usize
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

    use std::io;
    use std::io::BufRead;
    use std::str;

    // ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
    // ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
    // diff: using std::io::BufRead::fill_buf()
    pub struct Parser<R> {
        pub reader: R,
        buf: Vec<u8>,
        pos: usize,
    }

    impl Parser<io::Empty> {
        pub fn from_str(s: &str) -> Parser<io::Empty> {
            Parser {
                reader: io::empty(),
                buf: s.as_bytes().to_vec(),
                pos: 0,
            }
        }
    }

    impl<R: BufRead> Parser<R> {
        pub fn new(reader: R) -> Parser<R> {
            Parser {
                reader: reader,
                buf: vec![],
                pos: 0,
            }
        }
        pub fn update_buf(&mut self) {
            self.buf.clear();
            self.pos = 0;
            loop {
                let (len, complete) = {
                    let buf2 = self.reader.fill_buf().unwrap();
                    self.buf.extend_from_slice(buf2);
                    let len = buf2.len();
                    (len, buf2[len - 1] <= 0x20)
                };
                self.reader.consume(len);
                if complete {
                    break;
                }
            }
        }
        pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
            loop {
                let mut begin = self.pos;
                while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                    begin += 1;
                }
                let mut end = begin;
                while end < self.buf.len() && (self.buf[end] > 0x20) {
                    end += 1;
                }
                if begin != self.buf.len() {
                    self.pos = end;
                    return unsafe { str::from_utf8_unchecked(&self.buf[begin..end]) }.parse::<T>();
                } else {
                    self.update_buf();
                }
            }
        }
        pub fn fast_i64(&mut self) -> i64 {
            loop {
                let mut begin = self.pos;
                while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                    begin += 1;
                }
                if begin == self.buf.len() {
                    self.update_buf();
                    continue;
                }
                let mut res = 0;
                let (is_positive, mut end) = match self.buf[begin] {
                    b'+' => (true, begin + 1),
                    b'-' => (false, begin + 1),
                    _ => (true, begin),
                };
                while end < self.buf.len() && (self.buf[end] > 0x20) {
                    res = res * 10 + (self.buf[end] as i64 - '0' as i64);
                    end += 1;
                }
                if begin != self.buf.len() {
                    self.pos = end;
                    return if is_positive { res } else { -res };
                } else {
                    self.update_buf();
                }
            }
        }
    }
}

use input_mcr::*;
use std::cmp::*;

#[derive(Clone)]
struct Bits {
    xs: Vec<u64>,
}

const BN: usize = 500;

impl Bits {
    pub fn new() -> Bits {
        Bits { xs: vec![0; BN] }
    }
    pub fn or_shiftl(&mut self, right: &Bits, n: usize) {
        for i in 0..BN {
            if i >= n / 64 {
                self.xs[i] |= right.xs[i - n / 64] << (n % 64);
            }
            if i >= n / 64 + 1 {
                self.xs[i] |= right.xs[i - n / 64 - 1] >> (64 - (n % 64));
            }
        }
    }
    pub fn or_shiftr(&mut self, right: &Bits, n: usize) {
        for i in 0..BN {
            if i + n / 64 < BN {
                self.xs[i] |= right.xs[i + n / 64] >> (n % 64);
            }
            if i + n / 64 + 1 < BN {
                self.xs[i] |= right.xs[i + 1 + n / 64] << (64 - (n % 64));
            }
        }
    }
    pub fn and_check(&self, right: &Bits, n: usize) -> bool {
        for i in 0..BN {
            if i >= n / 64 {
                if (self.xs[i] & right.xs[i - n / 64]) << (n % 64) != 0 {
                    return true;
                }
            }
            if i >= n / 64 + 1 && n % 64 != 0 {
                if (self.xs[i] & right.xs[i - n / 64 - 1]) >> (64 - (n % 64)) != 0 {
                    return true;
                }
            }
        }
        false
    }
    pub fn set(&mut self, i: usize) {
        self.xs[i / 64] |= 1 << (i % 64);
    }
    pub fn seted(&self, i: usize) -> bool {
        self.xs[i / 64] & (1 << (i % 64)) != 0
    }
}

fn main() {
    input! {
        h: usize,
        w: usize,
        xs: [[i64; w]; h],
        ys: [[i64; w]; h],
    }
    let mut dp = vec![Bits::new(); w * h];
    dp[0 * w + 0].set(12800 + xs[0][0] as usize - ys[0][0] as usize);
    dp[0 * w + 0].set(12800 + ys[0][0] as usize - xs[0][0] as usize);
    for y in 0..h {
        for x in 0..w {
            if y >= 1 {
                let t = dp[(y - 1) * w + x].clone();
                let shift = (xs[y][x] - ys[y][x]).abs() as usize;
                dp[y * w + x].or_shiftl(&t, shift);
                dp[y * w + x].or_shiftr(&t, shift);
            }
            if x >= 1 {
                let t = dp[y * w + (x - 1)].clone();
                let shift = (xs[y][x] - ys[y][x]).abs() as usize;
                dp[y * w + x].or_shiftl(&t, shift);
                dp[y * w + x].or_shiftr(&t, shift);
            }
            // eprint!("y={},x={}: ", y, x);
            for k in 0..12800 * 2 + 1000 {
                if dp[y * w + x].seted(k) {
                    // eprint!("{} ", k);
                }
            }
            // eprintln!();
        }
    }
    let mut res = 100000000;
    for i in 0..12800 * 2 + 1000 {
        if dp[h * w - 1].seted(i) {
            res = min(res, (i as i64 - 12800).abs());
        }
    }
    println!("{}", res);
}