#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

// [l, r) from l to r
struct range {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { ++i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr range(int l_, int r_): l(l_), r(std::max(l_, r_)) { }
  constexpr itr begin() const { return l; }
  constexpr itr end() const { return r; }
};

// [l, r) from r to l
struct revrange {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { --i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr revrange(int l_, int r_): l(l_ - 1), r(std::max(l_, r_) - 1) { }
  constexpr itr begin() const { return r; }
  constexpr itr end() const { return l; }
};

int main() {
  int M, N;
  std::cin >> M >> N;
  std::vector<int> sum(N);
  std::vector<std::vector<int>> treasure(M, std::vector<int>(N));
  for (int i: range(0, M)) {
    for (int j: range(0, N)) {
      std::cin >> treasure[i][j];
      sum[j] += treasure[i][j];
    }
  }
  std::vector<int> get(M);
  for (int i: range(0, M)) {
    for (int j: range(0, N)) {
      get[i] += sum[j] * treasure[i][j];
    }
  }
  std::sort(get.begin(), get.end(), std::greater<>());
  int ans = 0;
  for (int i: range(0, M)) {
    ans += get[i] * (i % 2 == 0 ? 1 : -1);
  }
  std::cout << ans << '\n';
  return 0;
}