#include <bits/stdc++.h>
using namespace std;
 
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
template<class T>void show(vector<T>v){for (int i = 0; i < v.size(); i++){cerr<<v[i]<<" ";}cerr<<"\n";}
typedef long long ll;

int suma[310];
int a[310][310];
int sente[310];
int gote[310];
signed main()
{
    /*a*a - (sum_a -a)*(sum_a - a) + ...
    -sum_a^2 + 2 *sum_a(4)*a
    -sum_b^2 + 2 *sum_b(3)*b
                    (2)*c
    -...
    -
    suma*a +sumb*b+sumc*c...の順に貪欲*/
    int n, m;
    cin >> n >> m;
    REP(i,n)
    {
        REP(j,m){
            cin >> a[i][j];
            suma[j] += a[i][j];
        }
    }
    vector<pair<int,int>> v(n);
    REP(i,n){
        v[i].first = 0;
        v[i].second = i;
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            v[i].first += suma[j] * a[i][j];
        }
    }
    sort(ALL(v));
    reverse(ALL(v));
    vector<bool> b(n, false);
    
    for (int i = 0; i < n; i++)
    {
        int x = v[i].second;
        if (i % 2 == 0)
        {
            REP(j,m){
                sente[j] += a[x][j];
            }
        }
        else{
            REP(j,m){
                gote[j] += a[x][j];
            }
        }
    }
    int s = 0, g = 0;
    for (int i = 0; i < m; i++)
    {
        s += sente[i] * sente[i];
        g += gote[i] * gote[i];
    }
    cout << s - g << endl;

    return 0;
}