#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,M;
  cin>>N>>M;
  vector<vector<ll>> A(N,vector<ll>(M,0));
  rep(i,N) rep(j,M) cin>>A[i][j];

  vector<ll> sum(M,0);
  rep(i,N) rep(j,M) sum[j]+=A[i][j];

  vector<ll> v;
  rep(i,N){
      ll res=0;
      rep(j,M) res+=2*sum[j]*A[i][j];
      v.push_back(res);
  }
  sort(v.rbegin(),v.rend());

  ll ans=0;
  for(int i=0;i<N;i+=2) ans+=v[i];
  rep(i,M) ans-=sum[i]*sum[i];

  cout<<ans<<endl;

  return 0;
}