#include <stdio.h>
int main()
{
	int n, m, c,p[10001][10001];
	scanf("%d %d %d", &n, &m, &c);
	for ( int i = 1; i <= n; i++)
	{
		for (int k = 1; k <= m; k++)
		{
			scanf("%d", &p[i][k]);
		}
	}
	int sum[10001][10001];
	for ( int i = 1; i <= n; i++)
	{
		for ( int k = 1; k <= m; k++)
		{
			sum[i][k] = p[i][k] + sum[i - 1][k] + sum[i][k - 1] - sum[i - 1][k - 1];
		}
	}
	int max = -100000000000,x,y;
	for (int i = c; i <= n; i++)
	{
		for (int k = c; k <= m; k++)
		{
			if (sum[i][k] - sum[i - c][k] - sum[i][k - c] + sum[i - c][k - c] > max)
				x = i - c; y = k - c; max=sum[i][k] - sum[i - c][k] - sum[i][k - c] + sum[i - c][k - c];
		}
	}
	printf("%d %d", x, y);
	return 0;
}