#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<62);

int main() {
    cin>>N>>M;
    mat a(N, vec(M));
    rep(i,N) rep(j,M) cin>>a[i][j];
    vec sum(M, 0);
    rep(i,N){
        rep(j,M) sum[j] += a[i][j];
    }
    vec value(N, 0);
    rep(i,N){
        rep(j,M) value[i] += sum[j] * a[i][j];
    }
    ll ans = 0;
    sort(ALL(value));
    reverse(ALL(value));
    rep(i,N){
        ans += value[i] * (i&1 ? -1 : 1);
    }
    cout<<ans<<endl;
}