#include<algorithm>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << endl

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

int w, h;
vector< vector<int> > s;
vector< vector<int> > sum;
int dp[1005][1005];

template<typename T>
bool chmax(T &_a, T _b){
    if(_a < _b){
        _a = _b;
        return true;
    }else{
        return false;
    }
}

template<typename T>
bool chmin(T &_a, T _b){
    if(_a > _b){
        _a = _b;
        return true;
    }else{
        return false;
    }
}

int solve(int i, int j){
    if(dp[i][j] < IINF){
        return dp[i][j];
    }else if(i == h && j == w){
        return dp[i][j] = 0;
    }

    int res;
    if((i + j) % 2 == 0){
        res = -IINF;
        if(i + 1 <= h) chmax(res, solve(i + 1, j) + (sum[i + 1][w] - sum[i + 1][j] - sum[i][w] + sum[i][j]));
        if(j + 1 <= w) chmax(res, solve(i, j + 1) - (sum[h][j + 1] - sum[h][j] - sum[i][j + 1] + sum[i][j]));
    }else{
        res = IINF;
        if(i + 1 <= h) chmin(res, solve(i + 1, j) + (sum[i + 1][w] - sum[i + 1][j] - sum[i][w] + sum[i][j]));
        if(j + 1 <= w) chmin(res, solve(i, j + 1) - (sum[h][j + 1] - sum[h][j] - sum[i][j + 1] + sum[i][j]));
    }

    return dp[i][j] = res;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> w >> h;

    s.resize(h);
    sum.resize(h + 1);
    sum[0].resize(w + 1);
    rep(i, h){
        s[i].resize(w);
        sum[i + 1].resize(w + 1);
        rep(j, w){
            cin >> s[i][j];
            sum[i + 1][j + 1] = s[i][j];
        }
    }

    rep(i, h + 1){
        reps(j, w){
            sum[i][j] += sum[i][j - 1];
        }
    }

    rep(j, w + 1){
        reps(i, h){
            sum[i][j] += sum[i - 1][j];
        }
    }

    fill(dp[0], dp[1005], IINF);

    cout << abs(solve(0, 0)) << endl;

    return 0;
}
