#include #define int long long #define rep(i, n) for(i = 0; i < n; i++) using namespace std; int n, m; int a[300][300]; int sumA[300]; signed main() { int i, j, k; cin >> n >> m; rep(i, n) rep(j, m) cin >> a[i][j]; int ans = 0; rep(j, m) { rep(i, n) sumA[j] += a[i][j]; ans += sumA[j] * sumA[j]; } bool used[300] = {false}; rep(i, n) { int bestScore, bestJ = -1; rep(j, n) { if (used[j]) continue; int score = 0; rep(k, m) { score -= 2 * sumA[k] * a[j][k]; } if (bestJ == -1 || bestScore > score) { bestScore = score; bestJ = j; } } if (i % 2 == 1) { ans += bestScore; } used[bestJ] = true; } cout << ans << endl; return 0; }