#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<vector<long long>> A(N, vector<long long>(M));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      cin >> A[i][j];
    }
  }
  vector<long long> sum(M, 0);
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      sum[j] += A[i][j];
    }
  }
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      A[i][j] *= sum[j];
    }
  }
  vector<long long> sum2(N);
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      sum2[i] += A[i][j];
    }
  }
  sort(sum2.begin(), sum2.end());
  reverse(sum2.begin(), sum2.end());
  long long ans = 0;
  for (int i = 0; i < N; i++){
    if (i % 2 == 0){
      ans += sum2[i];
    } else {
      ans -= sum2[i];
    }
  }
  cout << ans << endl;
}