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

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;


void main() {
    int H, W;
    scan(H, W);
    auto a = iota(H).map!(i => readln.split.to!(int[])).array;
    auto b = iota(H).map!(i => readln.split.to!(int[])).array;

    auto c = new int[][](H, W);
    foreach (i ; 0 .. H) {
        foreach (j ; 0 .. W) {
            c[i][j] = abs(a[i][j] - b[i][j]);
        }
    }

    auto dp = new int[][][](H, W, 0);
    dp[0][0] ~= c[0][0];

    foreach (i ; 0 .. H) {
        foreach (j ; 0 .. W) {
            if (i - 1 >= 0) {
                foreach (d ; dp[i - 1][j]) {
                    dp[i][j] ~= abs(d - c[i][j]);
                    dp[i][j] ~= abs(d + c[i][j]);
                }
            }
            if (j - 1 >= 0) {
                foreach (d ; dp[i][j - 1]) {
                    dp[i][j] ~= abs(d - c[i][j]);
                    dp[i][j] ~= abs(d + c[i][j]);
                }
            }
            dp[i][j] = dp[i][j].sort().group.map!(x => x[0]).array;
        }
    }

    debug {
        writefln("%(%s %)", dp);
    }

    auto ans = dp[H - 1][W - 1].sort!"abs(a) < abs(b)".front;
    writeln(ans);
}






void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x > arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;

    foreach (arg; args) {
        if (x < arg) {
            x = arg;
            isChanged = true;
        }
    }

    return isChanged;
}
