#include using namespace std; using ll = long long; using pii = pair; template using V = vector; template using VV = V>; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define ALL(c) (c).begin(), (c).end() constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template void chmin(T& t, const U& u) { if (t > u) t = u; } template void chmax(T& t, const U& u) { if (t < u) t = u; } template ostream& operator<<(ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template ostream& operator<<(ostream& os, const vector& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif int main() { int N, M; cin >> N >> M; V sum(M); VV A(N, V(M)); rep(i, N) { rep(j, M) { cin >> A[i][j]; sum[j] += A[i][j]; } } V> vec(N); rep(i, N) { ll s = 0; rep(j, M) { s += (ll)A[i][j] * sum[j]; } vec[i] = mp(s, i); } sort(ALL(vec)); reverse(ALL(vec)); V tp(N); rep(i, N) { tp[vec[i].se] = i & 1; } VV C(2, V(M)); rep(i, N) { rep(j, M) { C[tp[i]][j] += A[i][j]; } } ll ans = 0; rep(i, M) { ans += C[0][i] * C[0][i]; ans -= C[1][i] * C[1][i]; } cout << ans << endl; return 0; }