#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n, m;
    cin >> n >> m;
    auto v = make_v(n, m, 0);
    vector<int> S(m);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> v[i][j];
            S[j] += v[i][j];
        }
    }
    vector<ll> A(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            A[i] += S[j]*v[i][j];
        }
    }
    sort(A.begin(),A.end(), greater<>());
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        if(i&1) ans -= A[i];
        else ans += A[i];
    }
    cout << ans << "\n";
    return 0;
}