//#define _GLIBCXX_DEBUG #include #define rep(i, n) for(int i=0; i; using vs = vector; using vi = vector; using vvi = vector; template using PQ = priority_queue; template using PQG = priority_queue, greater >; const int INF = 100010001; const ll LINF = (ll)INF*INF*10; template inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);} template inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);} template istream &operator>>(istream &is, pair &p) { return is >> p.first >> p.second;} template ostream &operator<<(ostream &os, const pair &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; }