#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long; 
using pii =  pair<int, int>;
using pll =  pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007LL;
//constexpr long long MOD = 998244353LL;
template<class T, class U> inline bool chmax(T &a, U b) { if (a < b) { a = b; return true;} return false; }
template<class T, class U> inline bool chmin(T &a, U b) { if (a > b) { a = b; return true;} return false; }
////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N,M; cin >> N >> M;
    vector<vector<ll>> A(N, vector<ll>(M));
    rep(i,N) rep(j,M) cin >> A[i][j];

    vector<ll> S(M);
    rep(i,N) rep(j,M) S[j] += A[i][j];
    vector<ll> B(N);
    rep(i,N) rep(j,M) B[i] += S[j]*A[i][j];

    vector<int> idx(N);
    iota(all(idx),0);
    sort(all(idx),[&](int i, int j){return B[i] > B[j];});
    vector<ll> P(M),Q(M);
    rep(i,N) {
        rep(j,M) {
            (i&1 ? Q[j] : P[j]) += A[idx[i]][j];
        }
    }
    ll ans = 0;
    rep(i,M) ans += P[i]*P[i] - Q[i]*Q[i];
    cout << ans << ln;
}