#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    int n,m;
    cin >> n >> m;
    vector<ll> s(m,0);
    vector<vector<ll>> a(n,vector<ll>(m));
    for (int i = 0;i < n;++i) for (int j = 0;j < m;++j) cin >> a[i][j];
    for (int i = 0;i < n;++i) for (int j = 0;j < m;++j) s[j] += a[i][j];
    vector<ll> b(n,0);
    for (int i = 0;i < n;++i) for (int j = 0;j < m;++j) b[i] += s[j]*a[i][j];
    sort(b.begin(),b.end());
    reverse(b.begin(),b.end());
    ll ans = 0;
    for (int i = 0;i < m;++i) ans -= s[i]*s[i];
    for (int i = 0;i < n;++i) {
        ans += 2*b[i]*(1-(i&1));
    }
    cout << ans << endl;
}