/* -*- coding: utf-8 -*-
 *
 * 1060.cc:  No.1060 素敵な宝箱 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 300;
const int MAX_M = 300;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N][MAX_M], ss[MAX_M], vs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++)
      scanf("%d", &as[i][j]), ss[j] += as[i][j];

  for (int i = 0; i < n; i++) {
    vs[i] = 0;
    for (int j = 0; j < m; j++) vs[i] += as[i][j] * ss[j];
  }
  sort(vs, vs + n, greater<int>());

  ll xs[2] = {0, 0};
  for (int i = 0; i < n; i++) xs[i & 1] += vs[i];

  printf("%lld\n", xs[0] - xs[1]);
  return 0;
}