#include <iostream>
#include <algorithm>
#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

using lint = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;

    auto xss = vec(n, vec(m, 0LL));
    for (auto& xs : xss) {
        for (auto& x : xs) {
            std::cin >> x;
        }
    }

    std::vector<lint> sums(m, 0);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            sums[j] += xss[i][j];
        }
    }

    std::vector<lint> scores(n, 0);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            scores[i] += sums[j] * xss[i][j];
        }
    }

    std::sort(scores.rbegin(), scores.rend());
    lint ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += scores[i] * (i % 2 == 0 ? 1 : -1);
    }

    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}