#include <bits/stdc++.h>
using namespace std;
int n, m, a[1010][1010], s[1010][1010], c;
int main() {
cin >> n >> m >> c;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++) cin >> a[i][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
s[i][j] = a[i][j] + s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
int ans = -1000000000, ansx, ansy;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
if(ans < s[i + c][j + c] - s[i - 1][j + c] - s[i + c][j - 1] + s[i - 1][j - 1]) ans = s[i + c][j + c] - s[i - 1][j + c] - s[i + c][j - 1] + s[i - 1][j - 1], ansx = i, ansy = j;
cout << ansx << ' ' << ansy;
return 0;
}