#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<math.h>
#include<algorithm>
#include<math.h>
#include<unordered_map>
#include<unordered_set>
using namespace std;

#define official

#ifdef official
#define cin inF
#define cout outF
#endif

ifstream inF("rabbits.in");
ofstream outF("rabbits.out");

const int MAX_N=64;

int n,m;
int d;
int r[MAX_N][MAX_N];
int ans;

void input()
{
    cin>>n>>m>>d;
    ++d;
    for (int i=0; i<n; ++i)
    {
        for (int j=0;j<m;++j)
        {
            cin>>r[i][j];
        }
    }
}
void output()
{
    cout<<ans<<'\n';
}

int total[MAX_N];
void solve()
{
    total[0]=0;
    ans=-1;
    int curr;
    for (int i=0;i<n;++i)
    {
        for (int j=0;j<m;++j)
        {
            total[j+1]=total[j]+r[i][j];
            for (int k=1;k<=d;++k)
            {
                if (k>j+1) continue;
                if (d-k<=i)
                {
                    curr=total[j+1]-total[j+1-k];
                    for (int p=1;p<=d-k;++p)
                    {
                        curr+=r[i-p][j];
                    }
                    //cerr<<"up: "<<i+1<<" "<<j+1<<" "<<k<<" "<<curr<<endl;
                    if (curr>ans) ans=curr;
                }
                if (d-k<=n-1-i)
                {
                    curr=total[j+1]-total[j+1-k];
                    for (int p=1;p<=d-k;++p)
                    {
                        curr+=r[i+p][j];
                    }
                    //cerr<<"down: "<<i+1<<" "<<j+1<<" "<<k<<" "<<curr<<endl;
                    if (curr>ans) ans=curr;
                }
            }
        }
    }
}

int main()
{
    input();
    solve();
    output();

    return 0;
}