#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N, M;
ll A[300][300];
ll sum[300];
ll B[300];
ll X, Y;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> M;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < M; j++){
            cin >> A[i][j];
            sum[j] += A[i][j];
        }
    }
    for(int i = 0; i < N; i++){
        for(int j = 0; j < M; j++){
            B[i] += A[i][j]*sum[j];
        }
    }
    sort(B, B+N, greater<ll>());
    for(int i = 0; i < N; i++){
        if(i%2 == 0) X += B[i];
        else Y += B[i];
    }
    cout << X-Y << endl;
}