#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000

int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<vector<long long>> A(N,vector<long long>(M));
	
	vector<long long> K(M);
	
	for(int i=0;i<N;i++){
		for(int j=0;j<M;j++){
			cin>>A[i][j];
			K[j]+=A[i][j];
		}
	}
	
	vector<long long> B(N);
	
	for(int i=0;i<N;i++){
		long long S = 0;
		for(int j=0;j<M;j++){
			S += A[i][j] * K[j];
		}
		B[i]=S;
	}
	
	sort(B.rbegin(),B.rend());
	
	long long ans = 0;
	for(int i=0;i<N;i++){
		if(i%2==0)ans+=B[i];
		else ans-=B[i];
	}
	
	cout<<ans<<endl;
	
	return 0;
}