/**
    Frățeanu Iustin-Alexandru
**/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned ll;
using i128 = __int128;
using sint = short int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpi = vector<pii>;
using vpl = vector<pll>;
template<typename T>
using vvector = vector<vector<T>>;
template<typename K, typename V>
using umap = unordered_map<K, V>;
template<typename T>
using uset = unordered_set<T>;
template<typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename A, typename B>
using vp = vector<pair<A, B>>;
#define FAST ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ef emplace_front
#define pob pop_back
#define pof pop_front
#define fs first
#define sd second
#define inf 0x3f3f3f3f
#define infll 0xfffffffffffffff
#define sz(v) (int)v.size()

int n, m, a[20][20], ans, sgn[20];

void bkt(int i) {
    if (i > n) {
        int tot = 0;
        for (int j = 1; j <= m; ++j) {
            int col = 0;
            for (int k = 1; k <= n; ++k) {
                col += a[k][j] * sgn[k];
            }

            tot += max(col, -col);
        }

        ans = max(ans, tot);
        return;
    }

    sgn[i] = 1;
    bkt(i + 1);
    sgn[i] = -1;
    bkt(i + 1);
}

signed main() {
    FAST
    freopen("flip.in", "r", stdin);
    freopen("flip.out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> a[i][j];
        }
    }

    bkt(1);
    cout << ans << "\n";
}