#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>

#ifdef DEBUG
#include "library/Utility/debug.cpp"
#else
#define debug(...)
#endif

#define rep(i,n) for(int i=0;i<(n);++i)
#define EL '\n'
#define print(i) std::cout << (i) << '\n'
#define all(v) (v).begin(), (v).end()
using lnt = long long;
constexpr lnt INF = 2e18;
/*-*/

int main() {
	int n,m;
	std::cin >> n >> m;
	std::vector<std::vector<lnt> > a(n,std::vector<lnt>(m));
	rep(i,n) rep(j,m) std::cin >> a[i][j];
	std::vector<lnt> c(m,0);
	rep(i,n) rep(j,m) c[j]+=a[i][j];
	std::vector<lnt> b(n,0);
	rep(i,n) {
		rep(j,m) b[i]+=c[j]*a[i][j];
	}
	std::sort(b.rbegin(),b.rend());
	lnt x=0,y=0;
	rep(i,n) {
		if(i&1) y+=b[i];
		else x+=b[i];
	}
	print(x-y);
}