#include <bits/stdc++.h>
#define int long long
using namespace std;
struct node {
	int l, r, minn[35], name[35];
} b[400005];
int ans;
int n, m, a[100005][9], maxn[35], op[35];
inline void update(int p) {
	for (int i = 0; i < (1 << m); i++) {
		if (b[2 * p].minn[i] < b[2 * p + 1].minn[i]) {
			b[p].name[i] = b[2 * p].name[i];
		} else {
			b[p].name[i] = b[2 * p + 1].name[i];
		}
		b[p].minn[i] = min(b[2 * p].minn[i], b[2 * p + 1].minn[i]);
	}
}
inline void build(int p, int l, int r) {
	b[p].l = l, b[p].r = r;
	if (l == r) {
		for (int i = 0; i < (1 << m); i++) {
			b[p].minn[i] = 0;
			b[p].name[i] = l;
			for (int j = 0; j < m; j++) {
				if ((i >> j) & 1) {
					b[p].minn[i] += a[l][j + 1];
				} else {
					b[p].minn[i] -= a[l][j + 1];
				}
			}
		}
//		cout << p << " " << l << " " << r << ' ' << b[p].minn[0] << "[]\n";
		return;
	}
	build(2 * p, l, (l + r) >> 1);
	build(2 * p + 1, ((l + r) >> 1) + 1, r);
	update(p);
//	cout << p << " " << l << " " << r << ' ' << b[p].minn[0] << "[]\n";
}
inline void change(int p, int q) {
	if (b[p].l == b[p].r) {
		for (int j = 0; j < (1 << m); j++) {
			b[p].minn[j] = 1e17;
		}
		return;
	}
	int mid = (b[p].l + b[p].r) >> 1;
	if (q <= mid) change(2 * p, q);
	else change(2 * p + 1, q);
	update(p);
//	cout << p << " " << b[p].l << "=====****" << b[p].r << ' ' << b[p].minn[0] << "[]\n";
}
signed main() {
//	freopen("ex_mst3.in", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	build(1, 1, n);
	change(1, 1);
//	cout << b[1].minn[0] << "[]\n";
	for (int i = 0; i < (1 << m); i++) {
		maxn[i] = 0;
		for (int j = 0; j < m; j++) {
			if ((i >> j) & 1) {
				maxn[i] += a[1][j + 1];
			} else {
				maxn[i] -= a[1][j + 1];
			}
		}
	}
//	cout << b[1].minn[0] << "[]\n";
	int maxa = LONG_LONG_MIN, maxb = -1;
	for (int qew = 2; qew <= n; qew++) {
		maxa = LONG_LONG_MIN;
		for (int j = 0; j < (1 << m); j++) {
//			cout << b[1].minn[j] << ' ' << maxn[j] << "|";
			if (maxn[j] - b[1].minn[j] > maxa) {
				maxa = maxn[j] - b[1].minn[j];
				maxb = b[1].name[j];
			}
		}
//		cout << "=====\n";
//		cout << maxa << ' ' << maxb << "\n";
		ans += maxa;
		for (int i = 0; i < (1 << m); i++) {
			op[i] = 0;
			for (int j = 0; j < m; j++) {
				if ((i >> j) & 1) {
					op[i] += a[maxb][j + 1];
				} else {
					op[i] -= a[maxb][j + 1];
				}
			}
			maxn[i] = max(maxn[i], op[i]);
		}
		change(1, maxb);
	}
	cout << ans;
}