#include <iostream>
#include <cmath>
#include <climits>
#include <fstream>

using namespace std;

const int MAX_N = 100;

int n, m;
int A[MAX_N][MAX_N];
int d;

int dist( int i1, int j1, int i2, int j2 )
{
    int ans = abs( i1 - i2 ) + abs( j1 - j2 );
    return ans;
}

void read()
{
    cin >> n >> m >> d;
    for( int i = 0; i < n; ++i )
    {
        for( int j = 0; j < m; ++j )
        {
            cin >> A[i][j];
        }
    }
}

int find_max( int i1, int j1 )
{
    int ans = INT_MIN;
    for( int i = 0; i < n; ++i )
    {
        for( int j = 0; j < m; ++j )
        {
            if( dist( i1, j1, i, j ) == d )
            {
                ans = max( A[i][j] + A[i1][j1], ans );
            }
        }
    }
    return ans;
}

void solve()
{
    int ans = INT_MIN;
    for( int i = 0; i < n; ++i )
    {
        for( int j = 0; j < m; ++j )
        {
            ans = max( find_max( i, j ), ans );
        }
    }

    if( ans >= 0 )
        cout << ans << endl;
    else
        cout << -1 << endl;
}

int main()
{
	freopen( "rabbits.in", "r", stdin );
	freopen( "rabbits.out", "w", stdout );
    ios_base::sync_with_stdio( true );
    read();
    solve();
    return 0;
}