#ifndef LOCAL
#include <bits/stdc++.h>
#define debug(...)
#endif

using namespace std;
#define int long long
#define cinv(v) for (auto &it:v) cin>>it;
#define coutv(v) for (auto &it:v) cout<< it<<' '; cout<<'\n';
using ll = long long;

ll INF = 1e15;

void shelby() {
    int n, k;
    cin >> n >> k;
    if (n == 1) return void(cout << "0\n");
    vector<vector<int> > v(n, vector<int>(k));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) cin >> v[i][j];
    }
    vector<int> perm(k);
    iota(perm.begin(), perm.end(), 0);
    ll ans = 0;
    do {
        sort(v.begin(), v.end(), [&](auto a, auto b)-> bool {
            for (auto &it: perm) {
                if (a[it] == b[it]) continue;
                return a[it] < b[it];
            }
            return true;
        });
        debug(v);
        ll now = 0, mn = INF;
        auto calc = [&](int i, int j)-> int {
            if (j < 0 || j == n) return 0;
            int ret = 0;
            for (int l = 0; l < k; ++l) ret += abs(v[i][l] - v[j][l]);
            return ret;
        };
        for (int i = 0; i < n; ++i) {
            int res = max(calc(i, i - 1), calc(i, i + 1));
            mn = min(mn, res);
            now += res;
        }
        ans = max(ans, now);
    } while (next_permutation(perm.begin(), perm.end()));
    cout << ans << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        // cout << "Case " << _ << ": ";
        shelby();
    }
}