#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;

    int L = N / 2;

    vector A(N, vector<int>(M));
    rep(i, N)rep(j, M) cin >> A[i][j];

    if(M == 1) {
        ll ans = 0;
        rep(i, L) ans -= A[i][0];
        rep(i, L) ans += A[i + N - L][0];
        cout << ans << endl;
    }
    else if(M == 2) {
        vector dp_m(L + 1, vector<ll>(L + 1, LINF));
        dp_m[0][0] = 0;
        rep(i, L)rep(j, i + 1) if(dp_m[i][j] >= 0) {
            chmin(dp_m[i + 1][j], dp_m[i][j] + A[i][0]);
            chmin(dp_m[i + 1][j + 1], dp_m[i][j] + A[i][1]);
        }

        vector dp_M(L + 1, vector<ll>(L + 1, -LINF));
        dp_M[0][0] = 0;
        rep(i, L)rep(j, i + 1) if(dp_M[i][j] >= 0) {
            chmax(dp_M[i + 1][j], dp_M[i][j] + A[N - L + i][0]);
            chmax(dp_M[i + 1][j + 1], dp_M[i][j] + A[N - L + i][1]);
        }

        ll ans = -LINF;
        rep(j, L + 1) chmax(ans, dp_M[L][j] - dp_m[L][j]);
        cout << ans << endl;
    }
    else {
        int BIG = 1e9;
        int st = 2 * L, en = 2 * L + 1;
        mcf_graph<int, ll> g(2 * L + 2);
        rep(i, L) {
            g.add_edge(st, i, 1, 0);
            g.add_edge(i + L, en, 1, 0);
        }

        rep(i, L)rep(j, L) {
            int mx = 0;
            rep(k, M) chmax(mx, A[j + N - L][k] - A[i][k]);
            g.add_edge(i, j + L, 1, BIG - mx);
        }

        auto res = g.flow(st, en);
        debug(res);

        cout << (ll)BIG * (ll)L - res.second << endl;
    }
}