#include<bits/stdc++.h>
using namespace std;

#define mp make_pair

#define MAXN 205
#define MAXV 55

int MAXVALUE;

int n,r,k,uk_fields;
int uk_values[MAXV],board_value[MAXN][MAXN];
int br_queens,uk_napada,br_napada[MAXN][MAXN];
int curr_sum,curr_res;
int res,br_queens_res;

pair<int,int> placed_queens[MAXN*MAXN],res_queens[MAXN*MAXN];

struct BoardField {
    int value,uk_sum,num_values[MAXV];
    pair<int,int> ind;
} board[MAXN*MAXN];

bool unutra(int x, int y) {
    return (x>=0 && x<n && y>=0 && y<n);
}

void init() {

    int i,j,c,d,di,dj,maxfreq;

    uk_fields = 0;

    for(i=0; i<n; i++) {
        for(j=0; j<n; j++) {

            board[uk_fields].uk_sum = 0;
            for(c=1; c<=MAXVALUE; c++) board[uk_fields].num_values[c] = 0;

            for(di=-1; di<=1; di++) {
                for(dj=-1; dj<=1; dj++) if (di!=0 || dj!=0) {
                    for(d=1; d<=r; d++) if ( unutra(i+di*d, j+dj*d) ){
                        board[uk_fields].uk_sum +=   board_value[i+di*d][j+dj*d];
                        board[uk_fields].num_values[ board_value[i+di*d][j+dj*d] ]++;
                    }
                }
            }

            board[uk_fields].uk_sum += 4*board_value[i][j];
            board[uk_fields].num_values[ board_value[i][j] ] += 4;

            maxfreq = 0;
            for(c=1; c<=MAXVALUE; c++) maxfreq = max(maxfreq, board[uk_fields].num_values[c]);

            board[uk_fields].value = maxfreq * board[uk_fields].uk_sum;

            board[uk_fields].ind = mp(i,j);

            //printf("-> %d %d -> %d\n", i, j, board[uk_fields].value);

            uk_fields++;
        }
    }
}

int sortColor;
bool sortByColor(BoardField a, BoardField b) {
    if (a.num_values[sortColor] > b.num_values[sortColor]) return true;
    if (a.num_values[sortColor] < b.num_values[sortColor]) return false;
    if (a.uk_sum > b.uk_sum) return true;
    return false;
}

bool sortByValue(BoardField a, BoardField b) {
    if (a.value > b.value) return true;
    return false;
}

void resetQueens() {

    int i,j,c;

    for(i=0; i<n; i++) {
        for(j=0; j<n; j++) {
            br_napada[i][j] = 0;
        }
    }

    br_queens = 0;
    curr_sum = 0;
    for(c=0; c<=MAXVALUE; c++) uk_values[c] = 0;
}

void addQueen(BoardField &field) {

    int x,y,d,c,di,dj;

    curr_sum += field.value;
    placed_queens[++br_queens] = field.ind;

    x = field.ind.first;
    y = field.ind.second;

    uk_napada += br_napada[x][y];

    for(di=-1; di<=1; di++) {
        for(dj=-1; dj<=1; dj++) if (di!=0 || dj!=0) {
            for(d=1; d<=r; d++) if ( unutra(x+di*d, y+dj*d) ) {
                br_napada[x+di*d][y+dj*d]++;
            }
        }
    }

    //for(c=1; c<=MAXVALUE; c++) uk_values[c] += field.num_values[c];
}

void updRes() {

    int i;

    res = curr_res;
    br_queens_res = br_queens;

    for(i=1; i<=br_queens; i++) res_queens[i] = placed_queens[i];

}

void tryToMaximizeColor(int C) {

    int i,c,maxfreq;

    resetQueens();

    sortColor = C;
    sort(board, board+uk_fields, sortByColor);

    uk_napada = 0;

    for(i=0; i<uk_fields; i++) {
        if (uk_napada + br_napada[board[i].ind.first][board[i].ind.second] <= k) {
            addQueen(board[i]);
        }
    }

    maxfreq = 0;
    for(c=1; c<=MAXVALUE; c++) maxfreq = max(maxfreq, uk_values[c]);

    printf("-> %d -> %d %d\n", C, curr_sum, maxfreq);

    curr_res = curr_sum * maxfreq;

    if (curr_res > res) {
        updRes();
    }
}

void greedyByValue() {

    int i;

    resetQueens();
    sort(board, board+uk_fields, sortByValue);

    uk_napada = 0;

    for(i=0; i<uk_fields; i++) {
        if (uk_napada + br_napada[board[i].ind.first][board[i].ind.second] <= k) {
            addQueen(board[i]);
        }
    }

    curr_res = curr_sum;

    if (curr_res > res) {
        updRes();
    }
}

int main() {

    int i,j;

    FILE *fin = fopen("queens.in", "r");

    fscanf(fin,"%d%d%d", &n, &r, &k);
    for(i=0; i<n; i++) {
        for(j=0; j<n; j++) {
            fscanf(fin,"%d", &board_value[i][j]);
            MAXVALUE = max(MAXVALUE, board_value[i][j]);
        }
    }
    fclose(fin);

    init();

    res = 0;
    br_queens_res = 0;

    // tryToMaximizeColor za 0 ce maksimizovati samo sumu
//    for(i=0; i<=MAXVALUE; i++) {
//        tryToMaximizeColor(i);
//    }

    greedyByValue();

    FILE *fout = fopen("queens.out", "w");

    //printf("uk kraljica = %d\n", br_queens_res);
    //printf("res = %d\n", res);

    for(i=1; i<=br_queens_res; i++) fprintf(fout, "%d %d\n", res_queens[i].first+1, res_queens[i].second+1);

    fclose(fout);

    return 0;
}