#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<utility>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<cassert>
#include<random>
#include<unordered_map>
#include<numeric>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define all(v) (v).begin(),(v).end()
#define stop char nyaa;cin>>nyaa;


using P = pair<int, int>;
using ll = long long;
using LP = pair<ll, ll>;

const ll inf = 1000000007;
const ll INF = inf * inf;




void solve() {
	int n, m; cin >> n >> m;
	vector<vector<int>> a(n, vector<int>(m));

	vector<int> s(m);
	rep(i, n)rep(j, m) {
		cin >> a[i][j];
		s[j] += a[i][j];
	}
	vector<ll> cost(n);
	rep(i, n) {
		rep(j, m) {
			cost[i] += 2 * s[j] * a[i][j];
		}
	}

	vector<LP> v;
	rep(i, n) {
		v.push_back({ cost[i],i });
	}
	sort(all(v), greater<LP>());
	ll ans = 0;
	for (int i = 0; i < v.size(); i += 2) {
		ans += v[i].first;
	}
	rep(j, m)ans -= (ll)s[j] * s[j];
	cout << ans << "\n";
}


signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int t; cin >> t;rep(i, t)solve();
	solve();
	stop
	return 0;
}