#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;


template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

ll dp[1005][1005];
void solve(){
	ll n,m;
	cin>>n>>m;
	ll ans=0;
	vector<ll>a(n);
	rep(i,n){
		rep(j,m){
			ll x;
			cin>>x;
			a[i]+=x;
		}
	}
	memset(dp,0,sizeof(dp));
	rep(i,n){
		rep(j,i+1){
			if(j%2==0)chmax(dp[i+1][j+1],dp[i][j]+a[i]);
			else chmax(dp[i+1][j+1],dp[i][j]-a[i]);
			chmax(dp[i+1][j],dp[i][j]);
		}
	}
	rep(i,n+1){
		chmax(ans,dp[n][i]);
	}
	cout<<ans<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}