#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll m, n, k, x[10];
const int N = 2e5 + 10;
ll a[N][10];
ll dp(int s, ll x[], ll tr) {
    if (s == n + 1 || tr == 0) {
        ll ans = 0;
        for (int i = 1; i <= m; i++) {
            ans += abs(x[i]);  
        }
        return ans;
    }
    // 1.不选a[s]
    ll ans;
    for (int i = 1; i <= m; i++) {
        x[i] += a[s][i];
    }
    ans = dp(s + 1, x, tr);
    for (int i = 1; i <= m; i++) {
        x[i] -= a[s][i];
    }
    ans = max(ans, dp(s + 1, x, tr - 1));
    
    return ans;
}
int main() {
    scanf("%lld%lld%lld", &n, &m, &k);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%lld", &a[i][j]);
        }
    }
    printf("%lld", dp(1, x, k));
    return 0;
}