#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 311;

int a[N][N];
int s[N];

ll b[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n, m; cin >> n >> m;
	for(int i = 0; i < n; i ++)
		for(int j = 0; j < m; j ++) {
			cin >> a[i][j];
			s[j] += a[i][j];
		}
	
	for(int i = 0; i < n; i ++)
		for(int j = 0; j < m; j ++)
			b[i] += a[i][j] * s[j];
	
	sort(b, b + n);
	
	ll ans = 0;
	for(int i = 0; i < n; i += 2)
		ans += b[i + 1] - b[i];
	cout << ans << '\n';
}