#include <bits/stdc++.h>

#define INF (1 << 30)
#define LLINF (1LL << 62)
#define mod 666013

using namespace std;

int n, r, k, i, j, o, e, x, y, v, rx, ry, vmax;
int f[55];
int a[205][205], b[205][205];

int cx[] = {-1, -1, -1,  0, +1, +1, +1, 0};
int cy[] = {-1,  0, +1, +1, +1,  0, -1, -1};

int main()
{
    freopen("queens.in", "r", stdin);
    freopen("queens.out", "w", stdout);

    scanf("%d%d%d", &n, &r, &k);
    for(i = 1; i <= n; i++)
        for(j = 1; j <= n; j++)
            scanf("%d", &a[i][j]);

    vmax = 0;
    for(i = 1; i <= n; i++)
        for(j = 1; j <= n; j++)
        {
            for(o = 1; o <= 50; o++)
                f[o] = 0;

            v = 4 * a[i][j];
            f[a[i][j]] = 4;
            for(o = 1; o <= r; o++)
                for(e = 0; e < 8; e++)
                {
                    x = i + o * cx[e];
                    y = j + o * cy[e];
                    if(x <= 0 || x > n || y <= 0 || y > n)
                        continue;

                    v += a[x][y];
                    f[ a[x][y] ]++;
                }

            e = 0;
            for(o = 1; o <= 50; o++)
                if(f[o] > f[e])
                    e = o;

            v *= e;
            b[i][j] = v;

            if(v > vmax)
            {
                vmax = v;
                rx = i;
                ry = j;
            }
        }

    printf("%d %d", rx, ry);

    return 0;
}