//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

int n, m;
int a[300][300], cnt[300];
ll sum, ss[300];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  rep(i, n) rep(j, m) cin >> a[i][j];
  rep(i, m) rep(j, n) cnt[i] += a[j][i];

  rep(i, m) {
    //cout << cnt[i] << endl;
    sum -= ll(cnt[i])*cnt[i];
    rep(j, n) {
      ss[j] += ll(a[j][i]) * cnt[i] << 1;
    }
  }

  sort(ss, ss+n);
  for(int i = n-1; i >= 0; i -= 2) {
    sum += ss[i];
  }

  cout << sum << endl;
}