#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,M,mapa[1005][1005],nums[300005],Bk,bs=-1,K=0,Ml;
bool prosli[1005][1005];
struct cord{
    ll x;
    ll y;
} tren[1005],naj[1005];
struct ipcord{
    ll x;
    ll y;
    ll n;
}pn[10];
void provera(){
    if(K>Ml)
        return;
    for(int i=1;i<=K;i++)
        nums[i]=mapa[tren[i].x][tren[i].y];
    ll score=0;
    score=K*2;
    ll najveci=-1;
    for(int i=1;i<K;i++)
        if(nums[i]<=najveci)
            score--;
        else najveci=nums[i];
    najveci=-1;
    for(int i=K;i>=1;i--)
        if(nums[i]<=najveci)
            score--;
        else najveci=nums[i];
    if(score>bs){
        bs=score;
        Bk=K;
        for(int i=1;i<=K;i++){
            naj[i].x=tren[i].x;
            naj[i].y=tren[i].y;
        }
    }
    return;
}
bool cmp(ipcord a,ipcord b){
    return a.n<b.n;
}
void alg1(ll x,ll y){
  //  cout<<x<<" "<<y<<endl;
    if(mapa[x][y]==-1)
        return;
    prosli[x][y]=true;
    tren[K+1].x=x;
    tren[K+1].y=y;
    K++;
    prosli[x][y]=true;
    provera();
    if(K>=Ml)
        return;
    pn[1].x=x+1;pn[1].y=y;pn[1].n=mapa[x+1][y];
    pn[2].x=x-1;pn[2].y=y;pn[2].n=mapa[x-1][y];
    pn[3].x=x;pn[3].y=y+1;pn[3].n=mapa[x][y+1];
    pn[4].x=x;pn[4].y=y-1;pn[4].n=mapa[x][y-1];
    sort(pn+1,pn+5,cmp);
    for(int i=1;i<=4;i++)
        if(pn[i].n>0 and prosli[pn[i].x][pn[i].y]==false){
            alg1(pn[i].x,pn[i].y);
            return;
        }

    return;
}
void alg1a(ll x,ll y){
  //  cout<<x<<" "<<y<<endl;
    if(prosli[x][y]==true or mapa[x][y]==-1 or x>N or y>M or x<1 or y<1 or K>Ml)
        return;
  //  cout<<x<<" "<<y<<endl;
    prosli[x][y]=true;
    tren[K+1].x=x;
    tren[K+1].y=y;
    K++;
    prosli[x][y]=true;
    provera();
    alg1a(x+1,y);
    alg1a(x-1,y);
    alg1a(x,y+1);
    alg1a(x,y-1);
    K--;
    //prosli[x][y]=false;
    return;
}
ll maksd;
void maxd(ll x,ll y,ll d){
    if(prosli[x][y]==true or mapa[x][y]==-1 or x>N or y>M or x<1 or y<1 or d>Ml)
        return;
    //cout<<x<<" "<<y<<endl;
    prosli[x][y]=true;
    maksd=max(maksd,d);
    maxd(x+1,y,d+1);
    maxd(x-1,y,d+1);
    maxd(x,y+1,d+1);
    maxd(x,y-1,d+1);
    return;
}
stack<cord> presli;
bool ret=0;
void maxd2(ll x,ll y,ll d){
    if(prosli[x][y]==true or mapa[x][y]==-1 or x>N or y>M or x<1 or y<1 or d>Ml)
        return;
    cout<<x<<" "<<y<<endl;
    cord h;
    h.x=x;
    h.y=y;
    presli.push(h);
    prosli[x][y]=true;
    if(d==maksd){
        K=presli.size();
        //cout<<presli.size()<<endl;
        for(int i=1;i<=presli.size();i++){
            tren[i].x=presli.top().x;
            tren[i].y=presli.top().y;
            presli.pop();
        }
        provera();
        ret=1;
        return;
    }
    maxd2(x+1,y,d+1);
    if(ret==1) return;
    maxd2(x-1,y,d+1);
    if(ret==1) return;
    maxd2(x,y+1,d+1);
    if(ret==1) return;
    maxd2(x,y-1,d+1);
    if(ret==1) return;
    presli.pop();
    return;
}
ll minimum=10000000000,xm,ym;
int main(){
    freopen("path.in","r",stdin);
    freopen("path.out","w",stdout);
    cin>>N>>M;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=M;j++){
            cin>>mapa[i][j];
            if(mapa[i][j]<minimum and mapa[i][j]>-1){
                minimum=mapa[i][j];
                xm=i;
                ym=j;
            }
        }
   // cout<<xm<<" "<<ym<<endl;
    cin>>Ml;
    //cout<<Ml<<endl;
    if(N<=20){
    for(int i=1;i<=N;i+=1)
        for(int j=1;j<=M;j+=1){
            for(int k=1;k<=N;k++)
                for(int d=1;d<=M;d++)
                   prosli[k][d]=false;
            K=0;
            //cout<<prosli[i][j]<<endl;
            //cout<<i<<" "<<j<<endl;
            alg1a(i,j);

        }
    }
    else alg1a(xm,ym);
    /*
    ret=0;
    for(int k=1;k<=N;k++)
        for(int d=1;d<=M;d++)
            prosli[k][d]=false;
    maxd(xm,ym,1);
    cout<<maksd<<endl;
    ret=0;
    for(int k=1;k<=N;k++)
        for(int d=1;d<=M;d++)
            prosli[k][d]=false;
    maxd2(xm,ym,1);
    */
    cout<<Bk<<endl;
    for(int i=1;i<=Bk;i++)
        cout<<naj[i].x<<" "<<naj[i].y<<endl;
    return 0;
}
/*
3 3
1 3 -1
-1 2 1
-1 1 1
4
*/