#include <bits/stdc++.h>
using namespace std;
#define FILE(x) freopen(x".in", "r", stdin);freopen(x".out", "w", stdout);
int n, m, K;
long long a[200001][9], b[200001], ans;
bool cmp(long long x, long long y){
	return x > y;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> K;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			cin >> a[i][j];
		}
	}
	for (int k = 0; k < (1 << m); k++){
		for (int i = 1; i <= n; i++){
			b[i] = 0;
			for (int j = 1; j <= m; j++){
				if (k & (1 << (j - 1))){
					b[i] += a[i][j];
				} else {
					b[i] -= a[i][j];
				}
			}
		}
		sort(b + 1, b + n + 1, cmp);
		long long cnt = 0;
		for (int i = 1; i <= K; i++){
			cnt += b[i];
		}
		ans = max(ans, cnt);
	}
	cout << ans;
	return 0;
}