#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;


int64_t solve(int n, int m, const vector<vector<int> > & a) {
    vector<int> b(m);
    REP (i, n) {
        REP (j, m) {
            b[j] += a[i][j];
        }
    }
    vector<int64_t> d(n);
    REP (i, n) {
        REP (j, m) {
            d[i] += b[j] * a[i][j];
        }
    }
    vector<int> order(n);
    iota(ALL(order), 0);
    sort(ALL(order), [&](int i, int j) { return d[i] > d[j]; });
    vector<int> c(m);
    REP (i, n / 2) {
        REP (j, m) {
            c[j] += a[order[2 * i]][j];
        }
    }
    int64_t ans = 0;
    REP (j, m) {
        ans += c[j] * c[j];
        ans -= (b[j] - c[j]) * (b[j] - c[j]);
    }
    return ans;
}

// generated by online-judge-template-generator v4.1.0 (https://github.com/kmyk/online-judge-template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    constexpr char endl = '\n';
    int n, m;
    cin >> n >> m;
    vector<vector<int> > a(n, vector<int>(m));
    REP (i, n) {
        REP (j, m) {
            cin >> a[i][j];
        }
    }
    auto ans = solve(n, m, a);
    cout << ans << endl;
    return 0;
}