#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
int n,r,k;
struct p{
    int x,y;
    int sum;
    bool is_marked;
};
bool cmp(p a,p b){return a.sum>b.sum;}
bool is_in(int x,int y)
{
    if(x>=0&&x<n&&y>=0&&y<n) return true;
    return false;
}
int main()
{
    fstream in("queens.in");
    in>>n>>r>>k;
    int pole[n][n],q=0;
    p m[n*n],maxp; maxp.sum=0;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++) in>>pole[i][j];
    int s;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            s=pole[i][j];
            for(int a=1;a<r;a++)
            {
                if(is_in(i,j+a)) s+=pole[i][j+a];
                if(is_in(i+a,j)) s+=pole[i+a][j];
                if(is_in(i-a,j)) s+=pole[i-a][j];
                if(is_in(i,j-a)) s+=pole[i][j-a];
                if(is_in(i+a,j+a)) s+=pole[i+a][j+a];
                if(is_in(i-a,j+a)) s+=pole[i-a][j+a];
                if(is_in(i+a,j-a)) s+=pole[i+a][j-a];
                if(is_in(i-a,j-a)) s+=pole[i-a][j-a];
            }
            m[q].sum=s;
            m[q].x=i;
            m[q].y=j;
            m[q].is_marked=false;
            if(maxp.sum<s){maxp.sum=s; maxp.x=q;}
            q++;
        }
    }
    m[maxp.x].is_marked=true;
    for(int i=1;i<k;i++)
    {
        int maxs1=0;
        int x,y,x1,y1;
        for(int a=1;a<r;a++)
        {
            if(is_in(x,y+a)&&m[(x+1)*y+a].sum>maxs1){maxs1=m[(x+1)*y+a].sum; x1=x; y1=y+a;}
            if(is_in(x+a,y)&&m[(x+1+a)*y].sum>maxs1){maxs1=m[(x+1+a)*y].sum; x1=x+a; y1=y;}
            if(is_in(x-a,y)&&m[(x+1-a)*y].sum>maxs1){maxs1=m[(x+1-a)*y].sum; x1=x-a; y1=y;}
            if(is_in(x,y-a)&&m[(x+1)*y-a].sum>maxs1){maxs1=m[(x+1)*y-a].sum; x1=x; y1=y-a;}
            if(is_in(x+a,y+a)&&m[(x+1+a)*y+a].sum>maxs1){maxs1=m[(x+1+a)*y+a].sum; x1=x+a; y1=y+a;}
            if(is_in(x-a,y+a)&&m[(x+1-a)*y+a].sum>maxs1){maxs1=m[(x+1-a)*y+a].sum; x1=x-a; y1=y+a;}
            if(is_in(x+a,y-a)&&m[(x+1+a)*y-a].sum>maxs1){maxs1=m[(x+1+a)*y-a].sum; x1=x+a; y1=y-a;}
            if(is_in(x-a,y-a)&&m[(x+1-a)*y-a].sum>maxs1){maxs1=m[(x+1-a)*y-a].sum; x1=x-a; y1=y-a;}
        }
        m[(x1+1)*y1].is_marked=true;
    }
    fstream out("queens.out");
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(m[(i+1)*j].is_marked==true) out<<i+1<<" "<<j+1<<endl;
        }
    }
    in.close();
    out.close();
    return 0;
}