#pragma GCC optimize("Ofast", "unroll-loops")

// #define TEST

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

#define ll long long

int N, M;
vector<vector<int>> A;
vector<ll> T;

void ready(){
    cin >> N >> M;
    A.resize(N, vector<int>(M));
    T.resize(M, 0LL);
    for (int i = 0; i < N; ++i){
        for (int j = 0; j < M; ++j){
            cin >> A[i][j];
            T[j] += A[i][j];
        }
    }
}

int main(void){
    ready();
    vector<ll> gain(N);
    for (int i = 0; i < N; ++i){
        ll tmp = 0;
        for (int j = 0; j < M; ++j)
            tmp += T[j] * A[i][j];
        gain[i] = tmp;
    }
    sort(gain.begin(), gain.end(), greater<ll>());
    ll res = 0;
    for (int i = 0; i < N; ++i){
        if (i & 1) res -= gain[i];
        else res += gain[i];
    }
    cout << res << endl;
    return 0;
}