#include<bits/stdc++.h>
using namespace std;
int a[1005][1005],dp[1005][1005];
int main(){
	int n,m,t;
	cin>>n>>m>>t;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
			dp[i][j]=a[i][j]+dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
		}
	}
	int maxn=-1000005,x,y;
	for(int i=1;i<=n-t+1;i++){
		for(int j=1;j<=m-t+1;j++){
				if(dp[i+t-1][j+t-1]-dp[i+t-1][j-1]-dp[i-1][j+t-1]+dp[i-1][j-1]>maxn){
					maxn=dp[i+t-1][j+t-1]-dp[i+t-1][j-1]-dp[i-1][j+t-1]+dp[i-1][j-1];
					x=i;y=j;
				}
		}
	}
	cout<<x<<" "<<y;
	return 0;
}