#include <iostream>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
priority_queue<pair<ll,ll>> que;
long long a[310][310],s[310] = {},fir[310] = {},sec[310] = {};
int main(){
    int i,j,n,m;
    cin >> n >> m;
    for(i=0;i<n;i++){
        for(j=0;j<m;j++){
            cin >> a[i][j];
            s[j] += a[i][j];
        }
    }
    for(i=0;i<n;i++){
        ll sc = 0;
        for(j=0;j<m;j++){
            sc += s[j]*a[i][j];
        }
        que.push({sc,i});
    }
    int f = 1;
    while(que.size()){
        pair<ll,ll> p = que.top();
        que.pop();
        i = p.second;
        if(f==1){
            for(j=0;j<m;j++){
                fir[j] += a[i][j];
            }
        }else{
            for(j=0;j<m;j++){
                sec[j] += a[i][j];
            }
        }
        f *= -1;
    }
    ll x = 0,y = 0;
    for(j=0;j<m;j++){
        x += fir[j]*fir[j];
        y += sec[j]*sec[j];
    }
    cout << x - y << endl;
}