#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
constexpr ll INF = numeric_limits<ll>::max()/4;
constexpr ll n_max = 2e5+10;
#define int ll

template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';}
string to_string(const char c) {return to_string((string) &c);}
string to_string(bool b) {return (b ? "true" : "false");}
template <size_t N>
string to_string(bitset<N> v){
    string res = "";
    for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
    return res;
}
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for(const auto &x : v) {
        if(!first) res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}

void debug_out() {cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template<class T>
bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}
template<class T>
bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}
struct state{
    state(){}
    vector<ll> v;
    ll sum = 0;
    state(vector<ll> &v):v(v) {
        for(auto &i : v)sum += i;
    }
};
signed main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,m; cin >> n >> m;
    vector<state> a(n);
    rep(i,n){
        vector<ll> v(m);
        rep(j,m)cin >> v[j];
        a[i] = state(v);
    }
    ll ans = -INF;
    // rep(k,m){
    //     sort(all(a), [&](const auto &a, const auto &b){
    //         return a.v[k] > b.v[k] || (a.v[k] == b.v[k] && a.sum > b.sum);
    //     });
    //     vector<ll> you(m), enj(m);
    //     rep(i,n){
    //         if(i & 1){
    //             rep(j,m)enj[j] += a[i].v[j];
    //         }
    //         else rep(j, m)you[j] += a[i].v[j];
    //     }

    //     ll x = 0, y = 0;
    //     rep(j,m){
    //         x += you[j] * you[j];
    //         y += enj[j] * enj[j];
    //     }
    //     debug(k);
    //     debug(you);
    //     debug(enj);
    //     chmax(ans, x - y);
    // }
    sort(all(a), [&](const auto &a, const auto &b){
        return a.sum > b.sum;
    });

    vector<ll> you(m), enj(m);
    rep(i,n){
        if(i & 1){
            rep(j,m)enj[j] += a[i].v[j];
        }
        else rep(j, m)you[j] += a[i].v[j];
    }

    ll x = 0, y = 0;
    rep(j,m){
        x += you[j] * you[j];
        y += enj[j] * enj[j];
    }

    ans = x - y;
    cout << ans << endl;
}