n,m,c=map(int,input().split())  #n行m列
s=[[0]*(m+1)]
x,y=0,0
for i in range(n):
    s.append([0]+list(map(int,input().split())))
for i in range(1,n+1):     #二维的前缀和
    for j in range(1,m+1):
        s[i][j]+=s[i][j-1]+s[i-1][j]-s[i-1][j-1]
ans=-1000
for i in range(1,n):
    for j in range(1,m):  #前缀和的遍历以边长为c来操作的
        temp=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 temp>ans:
            ans=temp
            x,y=i,j
        
print(x,y)