#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
long long i,j,p,q,n,m,k,a[1001][1001],MAXL,t,max1,ans,c[1000001],LDS,LIS,c1[1000001];
int b[1001][1001],fl=0;
struct Pic
{
    int l,r;
} t1,t2,t3;
vector <Pic> v[1000001];
void rek(int l,int r,int br)
{
    if(l<1 || l>n || r<1 || r>m || a[l][r]==-1)return ;
    if(br==MAXL+1)
    {
        fl=1;
        return ;
    }
    t1.l=l;
    t1.r=r;
    b[l][r]=1;
    v[k].push_back(t1);
    if(b[l][r+1]==0 && a[l][r+1]!=-1 && fl==0)rek(l,r+1,br+1);
    if(b[l+1][r]==0 && a[l+1][r]!=-1 && fl==0)rek(l+1,r,br+1);
    if(b[l][r-1]==0 && a[l][r-1]!=-1 && fl==0)rek(l,r-1,br+1);
    if(b[l-1][r]==0 && a[l-1][r]!=-1 && fl==0)rek(l-1,r,br+1);

    fl=1;
    return ;
}
int dvt(long long p)
{
    long long l,r,mid;
    l=0;
    r=LDS+1;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(t>c[mid-1] && (t<c[mid] || (c[mid]==0)))return mid;
        else if(p>=c[mid])l=mid+1;
        else r=mid-1;
    }
    return -1;
}
int dvt1(long long p)
{
    long long l,r,mid;
    l=0;
    r=LDS+1;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(t<c1[mid-1] && (t>c1[mid] || (c1[mid]==0)))return mid;
        else if(p<=c1[mid])l=mid+1;
        else r=mid-1;
    }
    return -1;
}
int main()
{
    freopen("path.in","r",stdin);
    freopen("path.out","w",stdout);
    cin>>n>>m;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            cin>>a[i][j];
        }
    }
    cin>>MAXL;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            //cout<<a[i][j]<<" ";
            if(b[i][j]==0 && a[i][j]!=-1)
            {
                fl=0;
                b[i][j]=1;
                k++;
                rek(i,j,1);
            }

        }
    }
    for(i=1; i<=k; i++)
    {
        p=v[i].size()-1;LDS=LIS=1;c1[0]=99999999;
        fill(c+1,c+MAXL+1,0);
        fill(c1+1,c1+MAXL+1,0);
        if(p<=MAXL)
        {
            for(j=0; j<v[i].size(); j++)
            {
                t=a[v[i][j].l][v[i][j].r];
                int poz=dvt(t);
                int poz1=dvt1(t);
                //cout<<poz<<" "<<t<<endl;
                if(poz!=-1)c[poz]=t;
                if(poz1!=-1)c1[poz1]=t;
                if(poz>LDS)LDS=poz;
                if(poz1>LIS)LIS=poz1;
            }
            //cout<<LDS<<endl;
            //cout<<LIS<<endl;
            q=LDS*LIS;
            //q - LDS*LIS
            if(q>max1){max1=q;ans=i;}
        }
        //cout<<endl;
    }
    cout<<v[ans].size()<<endl;
    for(j=0; j<v[ans].size(); j++)
    {
        cout<<v[ans][j].l<<" "<<v[ans][j].r<<endl;
    }
    return 0;
}
/*
3 3
1 3 -1
-1 2 1
-1 1 1
4
5 4
1 3 -1 1
-1 2 -1 -1
-1 -1 -1 -1
2 3 -1 1
4 -1 3 7
5

1 7
1 2 3 2 1 4 5

cout<<v[i][j].l<<" "<<v[i][j].r<<"     ";
*/