#include <iostream>

using namespace std;

const int N = 1e3+10;

typedef long long LL;

long long a[N][N],s[N][N];

long long  n,m,c;
LL x,y;
long long res;

int main()
{
    cin>>n>>m>>c;


    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            scanf("%lld",&a[i][j]);
    }

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            s[i][j] = s[i-1][j] + s[i][j-1] + a[i][j] - s[i-1][j-1];
    }

    for(int i=1;i<=n-c+1;i++)
    {
        for(int j=1;j<=m-c+1;j++)
        {
            int v = s[i+c-1][j+c-1] - s[i+c-1][j-1] - s[i-1][j+c-1] + s[i-1][j-1];
            if(v > res)
            {
                res = v;
                x = i, y = j;
            }
        }
    }

    cout<<x<<' '<<y<<endl;


}