#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, k, a[11][200001], ans , b[200001];
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
bool vis[21];
void dfs(int x)
{
    if (x == n + 1)
    {
        int sum = 0, tot = 0, aa[11];
        memset(aa, 0, sizeof(aa));
        for (int i = 1; i <= n; i++)
        {
            if (vis[i])
            {
                tot++;
            }
        }
        if (tot != k)
        {
            return;
        }
        for (int i = 1; i <= n; i++)
        {
            if (vis[i])
            {
                for (int j = 1; j <= m; j++)
                {
                    aa[j] += a[j][i];
                }
            }
        }
        for (int i = 1; i <= m; i++)
        {
            //cout << aa[i] << " ";
            sum += abs(aa[i]);
        }
        //cout << endl;
        ans = max(ans, sum);
        return;
    }
    vis[x] = 1;
    dfs(x + 1);
    vis[x] = 0;
    dfs(x + 1);
}
signed main()
{
    n = read(), m = read(), k = read();
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            a[j][i] = read();
        }
    }
    if(m==1)
    {
        int aa=0,bb=0;
        for (int i = 1; i <= n; i++)
        {
            b[i]=a[1][i];
        }
        sort(b+1,b+n+1);
        for (int i = 1; i <= k; i++)
        {
            aa+=abs(b[i]);
        }
        for(int i = n; i >= n - k; i--)
        {
            bb+=abs(b[i]);
        }
        printf("%lld",max(aa,bb));
    }
    else
    {
        dfs(1); 
        printf("%lld", ans);
    }
    return 0;
}