#include<iostream>
#include <map>
#include<set>
#include<algorithm>
#include<stdio.h>
using namespace std;
bool izp[200*200];
struct kletka
{
    int x, y, v;
};
bool sr( kletka a, kletka b)
{
    return a.v>b.v;
}
long long otg;
kletka kl[400];
int pole[200][200];
int n,r,k;
int posokaX[8]={0 ,1  , 1, 1, 0 ,-1, -1, -1} ;
int posokaY[8]={-1, -1, 0, 1, 1 , 1, 0 , -1};
int  used[200][200];
int tochki(int x, int y)
{
    map<int, int> m;
    set<int> sreshtani;
    int res=0;
    for(int i=1;i<=r;i++)
    {
        for(int h=0;h<8;h++)
        {
            if(x+posokaX[h]*i<n && x+posokaX[h]*i>=0 && y+posokaY[h]*i<n && y+posokaY[h]*i>=0)
            {
                res+=pole[x+posokaX[h]*i][y+posokaY[h]*i];
                sreshtani.insert(pole[x+posokaX[h]*i][y+posokaY[h]*i]);
                m[pole[x+posokaX[h]*i][y+posokaY[h]*i]]++;
               // cout<<x+posokaX[h]*i<<" "<<y+posokaY[h]*i<<" "<<pole[x+posokaX[h]*i][y+posokaY[h]*i]<<endl;
            }
        }

    }
    m[pole[x][y]]+=4;
    res+=(pole[x][y]*4);
    int maxx=0, chislo;
    //cout<<sreshtani[0];
    for(set<int>:: iterator it=sreshtani.begin() ;it!=sreshtani.end();it++)
    {
        if(m[*it]>maxx)///oprej go
        {
            maxx=m[*it];
            chislo=*it;
        }
    }
   // cout<<m[chislo]<<" "<<res<<" "<<chislo<<endl;
    return res*m[chislo];
}
void zaemiPoleta(int x, int y)
{
    for(int i=1;i<=r;i++)
    {
         for(int h=0;h<8;h++)
        {
            if(x+posokaX[h]*i<n && x+posokaX[h]*i>=0 && y+posokaY[h]*i<n && y+posokaY[h]*i>=0)
            {
                used[x+posokaX[h]*i][y+posokaY[h]*i]++;
               // cout<<x+posokaX[h]*i<<" "<<y+posokaY[h]*i<<" "<<pole[x+posokaX[h]*i][y+posokaY[h]*i]<<endl;
            }
        }
    }
    used[x][y]=1;
}
int bluskamLiSe(int x, int y)/// optimiziraj go!!
{
    int otg=0;
    for(int i=1;i<=r;i++)
    {
         for(int h=0;h<8;h++)
        {
            if(x+posokaX[h]*i<n && x+posokaX[h]*i>=0 && y+posokaY[h]*i<n && y+posokaY[h]*i>=0)
            {
               if( used[x+posokaX[h]*i][y+posokaY[h]*i])
                {
                    if(used[x+posokaX[h]*i][y+posokaY[h]*i]>otg)
                        otg=used[x+posokaX[h]*i][y+posokaY[h]*i];
                }
               // cout<<x+posokaX[h]*i<<" "<<y+posokaY[h]*i<<" "<<pole[x+posokaX[h]*i][y+posokaY[h]*i]<<endl;
            }
        }
    }
    return otg;
}
int main(){
freopen("queens.in","r",stdin);
freopen("queens.out","w",stdout);
cin>>n>>r>>k;
for(int y=0;y<n;y++)
{
    for(int x=0;x<n;x++)
    {
        cin>>pole[x][y];
    }
}
int next=0;

for(int Y=0;Y<n;Y++)
{
    for(int X=0;X<n;X++)
    {
        kl[next].x=X;
        kl[next].y=Y;
        kl[next].v=tochki(X,Y);
        next++;
    }
}
sort(kl, kl+next, sr);
//for(int i=0;i<next;i++)
  //  cout<<kl[i].x+1<<" "<<kl[i].y+1<<" "<<kl[i].v<<endl;
//cout<<"posle\n";
//zaemiPoleta(kl[0].x, kl[0].y);
//otg+=kl[0].v;
//cout<<kl[0].y+1<<" "<<kl[0].x+1<<endl;
/*
for(int i=0;i<next;i++)
{
   // cout<<kl[i].x<<" "<<kl[i].y<<endl;
    if(!bluskamLiSe(kl[i].x, kl[i].y))
    {
        //cout<<"aaaa\n";
        zaemiPoleta(kl[i].x,kl[i].y);
        cout<<kl[i].y+1<<" "<<kl[i].x+1<<endl;
      //  kl[i].v=-1;
         otg+=kl[i].v;
    }

}
*/
/*
}*/

for(int i=0;i<next;i++)
{
    if(bluskamLiSe(kl[i].x, kl[i].y)<=k){
        zaemiPoleta(kl[i].x, kl[i].y);
        izp[i]=1;
        cout<<kl[i].x<<" "<<kl[i].y<<endl;
        k-=bluskamLiSe(kl[i].x, kl[i].y);
    }
}
for(int i=0;i<next;i++)
{
    if(!izp[i] && bluskamLiSe(kl[i].x, kl[i].y)==0){
        zaemiPoleta(kl[i].x, kl[i].y);
      //  izp[kl[i].x][kl[i].y]=1;
        cout<<kl[i].x<<" "<<kl[i].y<<endl;
       // k-=bluskamLiSe(kl[i].x, kl[i].y);
    }
}

/*
for(int y=0;y<n;y++)
{
    for(int x=0;x<n;x++)
    {
        if(bluskamLiSe(x,y)==0){
            zaemiPoleta(x,y);
            cout<<x<<" "<<y<<endl;

        }
    }
}*/
//cout<<otg;

return 0;
}