#include <iostream>
#include <stdio.h>
using namespace std;
int a[1001][1001];
int main()
{
    int m, n, k, max = -99999, xi, yj, num = 0, mi, mj, sum = 0;
    scanf("%d%d%d", &m, &n, &k);
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            scanf("%d", &a[i][j]);
        }
    }
    mi = 0;
    mj = -1;
    while (1)
    {
        max = 0;
        for (int i = 1; i <= m; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (a[i][j] > max)
                {
                    max = a[i][j];
                    xi = i;
                    yj = j;
                }
            }
        }
        if (max == 0)
            break;
        int temp = 0;

        if (mi == 0)
        {
            temp++;
            mi = 1;
            temp += abs(xi - mi) + 1;
        }
        else
        {
            temp += abs(xi - mi);
            temp += abs(yj - mj);
            temp++;
        }
        if ((xi + temp + num) <= k)
        {
            sum += a[xi][yj];
            mi = xi;
            mj = yj;
            num += temp;
            a[xi][yj] = 0;
        }
        else
        {
            break;
        }
    }
    printf("%d", sum);
    return 0;
}