#include<bits/stdc++.h>
using namespace std;
const int N=3010;
long long a[N][N],s[N][N],d[N][N];
int main(){
	int n,m,c;
	cin>>n>>m>>c;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j]; 
			s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
		}
	}
	int maxx=s[0][0];
	int xx;
	int yy;
	for(int i=c;i<=n;i++){
		for(int j=c;j<=m;j++){
		if(s[i][j]-s[i-c][j]-s[i][j-c]+s[i-c][j-c]>maxx){
			maxx=s[i][j]-s[i-c][j]-s[i][j-c]+s[i-c][j-c];
			xx=i-c+1;
			yy=j-c+1;
		}	
		}
	cout<<xx<<" "<<yy;
	return 0;
}
}