#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
#include<stack>


using namespace std;


#define MAXN 512

struct sortable
{
    int x;
    int y;
    long long val;
};

int n,k,r;
int ma3x[MAXN][MAXN];
sortable pc[MAXN*MAXN];
bool queens[MAXN][MAXN];

stack< pair < int, int > > placed_queens;



int cnt=0;

bool cust(sortable a, sortable b)
{
    return a.val>b.val;
}

bool cust2(sortable a, sortable b)
{
    return a.val<b.val;
}
void input_stuff()
{
	freopen("queens.in","r",stdin);
	freopen("queens.out","w",stdout);
}

void input()
{
	input_stuff();
	cin>>n>>r>>k;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++) cin >> ma3x[i][j];
	}
	//freopen("/dev/stdin/", "r", stdin);
}

long long precompute(int x, int y)
{
	//cout<<"hello, precomputing for "<<ma3x[x][y]<<endl;

	int a,b,i,j;
	long long sum=0;
	vector<int> numbers;
	vector<int> count_arr;

	// up left down right diag
	for( a=0;a<=2*r;a++ )
    {
        i = x-r + a;
		j = y-r + a;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            sum+=ma3x[i][j];
            bool found=0;
            for(b=0;b<numbers.size();b++) if(numbers[b]==ma3x[i][j]){ found=1; count_arr[b]++; }
            if(found==0)
            {
                numbers.push_back(ma3x[i][j]);
                count_arr.push_back(1);
            }
        }
    }

    //left to right
    for( a=0;a<=2*r;a++ )
    {
        i = x;
		j = y-r + a;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            sum+=ma3x[i][j];
            bool found=0;
            for(b=0;b<numbers.size();b++) if(numbers[b]==ma3x[i][j]){ found=1; count_arr[b]++; }
            if(found==0)
            {
                numbers.push_back(ma3x[i][j]);
                count_arr.push_back(1);
            }
        }
    }

    // down left up right diag
    for( a=0;a<=2*r;a++ )
    {
        i = x+r - a;
		j = y-r + a;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            sum+=ma3x[i][j];
            bool found=0;
            for(b=0;b<numbers.size();b++) if(numbers[b]==ma3x[i][j]){ found=1; count_arr[b]++; }
            if(found==0)
            {
                numbers.push_back(ma3x[i][j]);
                count_arr.push_back(1);
            }
        }
    }

    // down to up
    for( a=0;a<=2*r;a++ )
    {
        i = x+r - a;
		j = y;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            sum+=ma3x[i][j];
            bool found=0;
            for(b=0;b<numbers.size();b++) if(numbers[b]==ma3x[i][j]){ found=1; count_arr[b]++; }
            if(found==0)
            {
                numbers.push_back(ma3x[i][j]);
                count_arr.push_back(1);
            }
        }
    }

	int maxc = 0;

	for(i=0;i<count_arr.size();i++) if(count_arr[i]>maxc)  maxc=count_arr[i];
	long long ret = sum * maxc;
	//cout<<" for "<<x<<" " <<y<<" - sum = "<<sum<<" , realsum = "<<ret<<endl;
	return ret;

}


int attempt_place(int x, int y)
{

    if(queens[x][y]>0) return 99999;

    int i,j;

    int a;
	for( a=0;a<=2*r;a++ )
    {
        if(cnt>k) break;
        i = x-r + a;
		j = y-r + a;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            if(queens[i][j]) cnt++;
        }
    }

    //left to right
    for( a=0;a<=2*r;a++ )
    {
        if(cnt>k) break;
        i = x;
		j = y-r + a;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            if(queens[i][j]) cnt++;
        }
    }

    // down left up right diag
    for( a=0;a<=2*r;a++ )
    {
        if(cnt>k) break;
        i = x+r - a;
		j = y-r + a;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            if(queens[i][j]) cnt++;
        }
    }

    // down to up
    for( a=0;a<=2*r;a++ )
    {
        if(cnt>k) break;
        i = x+r - a;
		j = y;

		if(i>0&&j>0&&i<=n&&j<=n)
        {
            if(queens[i][j]) cnt++;
        }
    }

    return cnt;

    //if(cnt>k) return false;
    //return true;
}

void clear_queens()
{
    while(!placed_queens.empty())
    {
        queens[placed_queens.top().first][placed_queens.top().second] = 0;
        placed_queens.pop();
    }
    //for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) queens[i][j]=0;
    //for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) if(queens[i][j]!=0) cout<<"what the fuck?"<<endl;
}



unsigned long long get_config()
{

    unsigned long long ans=0;
    cnt = 0;



    for(int i=0;i<n*n;i++)
    {
        int oldcnt=cnt;
        if(attempt_place(pc[i].x,pc[i].y)<=k)
        {
            //cout<<"placing queen at "<<pc[i].x<<","<<pc[i].y<<" it attacked "<<cnt-oldcnt<<endl;
            queens[pc[i].x][pc[i].y]=1;
            ans+=pc[i].val;
            placed_queens.push(make_pair(pc[i].x,pc[i].y));
        }
        else cnt=oldcnt;
    }


    return ans;
}

bool cust3(sortable a, sortable b)
{
    cnt = 0;
    int x1 = attempt_place(a.x,a.y);
    cnt = 0;
    int x2 = attempt_place(b.x,b.y);


    return a.val*(k-x1)>b.val*(k-x2);
    if(x1<x2&&a.val>=b.val) return true;


    if(x1==x2) return a.val>b.val;
    return x1<x2;
}

unsigned long long get_config3()
{
    unsigned long long ans=0;
    cnt =0;

    for(int i=0;i<n*n;i++)
    {
        int oldcnt=cnt;
        if(attempt_place(pc[i].x,pc[i].y)==0)
        {
            queens[pc[i].x][pc[i].y]=1;
            ans+=pc[i].val;
            placed_queens.push(make_pair(pc[i].x,pc[i].y));
            //cout<<"placing shit on "<<pc[i].x<<", "<<pc[i].y<<" - cnt="<<cnt<<endl;
        }
        else cnt=oldcnt;
    }

    sort(pc,pc+n*n,cust3);

    for(int i=0;i<n*n;i++)
    {
        int oldcnt=cnt;
        if(queens[pc[i].x][pc[i].y]==1) continue;
        if(attempt_place(pc[i].x,pc[i].y)<=k)
        {
            queens[pc[i].x][pc[i].y]=1;
            ans+=pc[i].val;
            placed_queens.push(make_pair(pc[i].x,pc[i].y));
            //cout<<"placing shit on "<<pc[i].x<<", "<<pc[i].y<<" - cnt="<<cnt<<endl;
        }
        else cnt=oldcnt;
    }
    //cout<<"ans "<<ans<<endl;
    return ans;
}

unsigned long long get_config2()
{
    unsigned long long ans=0;
    cnt =0;

    for(int i=0;i<n*n;i++)
    {
        int oldcnt=cnt;
        if(attempt_place(pc[i].x,pc[i].y)==0)
        {
            queens[pc[i].x][pc[i].y]=1;
            ans+=pc[i].val;
            placed_queens.push(make_pair(pc[i].x,pc[i].y));
            //cout<<"placing shit on "<<pc[i].x<<", "<<pc[i].y<<" - cnt="<<cnt<<endl;
        }
        else cnt=oldcnt;
    }

    for(int i=0;i<n*n;i++)
    {
        int oldcnt=cnt;
        if(queens[pc[i].x][pc[i].y]==1) continue;
        if(attempt_place(pc[i].x,pc[i].y)<=k)
        {
            queens[pc[i].x][pc[i].y]=1;
            ans+=pc[i].val;
            placed_queens.push(make_pair(pc[i].x,pc[i].y));
            //cout<<"placing shit on "<<pc[i].x<<", "<<pc[i].y<<" - cnt="<<cnt<<endl;
        }
        else cnt=oldcnt;
    }

    return ans;
}

void solve()
{
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){ pc[(i-1)*n+j-1].val=precompute(i,j); pc[(i-1)*n+j-1].x=i; pc[(i-1)*n+j-1].y=j; }

	//for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++) cout<<pc[(i-1)*n+j-1].val<<" "; cout<<endl;}

	sort(pc,pc+n*n,cust);

    unsigned long long maxans = get_config();

    //while(!placed_queens.empty()){ cout<<placed_queens.top().first<<" "<<placed_queens.top().second<<endl; placed_queens.pop(); }
    //cout<<maxans<<" 1111 "<<endl;
    //while(!placed_queens.empty()){ cout<<placed_queens.top().first<<" "<<placed_queens.top().second<<endl; placed_queens.pop(); }

    stack<pair < int, int > > queens_max = placed_queens;


    clear_queens();

    unsigned long long ssw=get_config2();

    //cout<<ssw<<" 2222"<<endl;
    //while(!placed_queens.empty()){ cout<<placed_queens.top().first<<" "<<placed_queens.top().second<<endl; placed_queens.pop(); }


    if(ssw>maxans)
    {
        queens_max=placed_queens;
        maxans=ssw;
    }


    clear_queens();

    if(n<50)
    ssw = get_config3();

    if(ssw>maxans)
    {
        queens_max=placed_queens;
        maxans=ssw;
    }


    //cout<<maxans<<endl;

    while(!queens_max.empty()){ cout<<queens_max.top().first<<" "<<queens_max.top().second<<endl; queens_max.pop(); }


}


int main()
{
	input();
	solve();
	return 0;