#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()

template<class T>
static inline std::vector<T> ndvec(size_t&& n, T val) noexcept {
  return std::vector<T>(n, std::forward<T>(val));
}

template<class... Tail>
static inline auto ndvec(size_t&& n, Tail&&... tail) noexcept {
  return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(n, ndvec(std::forward<Tail>(tail)...));
}

template<class T, class Cond>
struct chain {
  Cond cond; chain(Cond cond) : cond(cond) {}
  bool operator()(T& a, const T& b) const {
    if(cond(a, b)) { a = b; return true; }
    return false;
  }
};
template<class T, class Cond>
chain<T, Cond> make_chain(Cond cond) { return chain<T, Cond>(cond); }

int main() {
  i64 N, M;
  cin >> N >> M;
  vector<vector<i64>> A(N, std::vector<i64>(M));
  vector<i64> C(M);
  rep(i,0,N) {
    rep(j,0,M) {
      cin >> A[i][j];
      C[j] += A[i][j];
    }
  }

  vector<i64> X(N);
  rep(i,0,N) {
    rep(j,0,M) {
      X[i] += A[i][j] * C[j];
    }
  }
  sort(all(X));
  i64 ans = 0;
  rep(i,0,N) {
    if(i & 1) {
      ans += X[i];
    }
    else {
      ans -= X[i];
    }
  }
  std::cout << ans << '\n';
}