#include <iostream>
#include <cmath>
#define int long long
using namespace std;
const int N = 2e5 + 5;
int n, m, k, a[N][10], path[N], ans = -1e18;
bool st[N];
void dfs(int u) {
    if (u == k) {
    	int cnt = 0;
        for (register int i = 1; i <= m; ++ i ) {
        	int sum = 0;
        	for (register int j = 0; j < k; j ++ ) sum += a[path[j]][i];
			cnt += abs(sum);
		}
		ans = max(ans, cnt);
        return;
    }
    for (register int i = 1; i <= n; ++ i )
        if (!st[i]) {
            path[u] = i;
            st[i] = true;
            dfs(u + 1);
            st[i] = false;
        }
    return;
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> k;
	for (register int i = 1; i <= n; ++ i ) 
		for (register int j = 1; j <= m; ++ j )
			cin >> a[i][j];
	dfs(0);
	cout << ans << "\n";
	return 0;
}