#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> P(M),Q(M);
    vector<bool> check(N);
    rep(turn,N) {
        ll result = -1;
        ll num = -1; 
        rep(i,N) {
            if (!check[i]) {
                if (turn&1) {
                    ll val = 0;
                    rep(j,M) {
                        val += (Q[j]+A[i][j])*(Q[j]+A[i][j]);
                    }
                    if (chmax(result,val)) num = i;
                } else {
                    ll val = 0;
                    rep(j,M) {
                        val += (P[j]+A[i][j])*(P[j]+A[i][j]);
                    }
                    if (chmax(result,val)) num = i;
                }
            }
        }
        rep(i,M) {
            if (turn&1) {
                Q[i] += A[num][i];
            } else {
                P[i] += A[num][i];
            }
        }
        check[num] = 1;
    }

    ll ans = 0;
    rep(i,M) {
        ans += P[i]*P[i] - Q[i]*Q[i];
    }

    cout << ans << ln;
}