# include <bits/stdc++.h>
# include <utility>
# include <random>
# include <ctime>
using namespace std;
//mt19937 mt_Rand(98564758);
double TL = 4.6;
clock_t start;
queue <pair < int,int> > ans;
int otg = 0;
queue <pair <int,int> > tek;
int d[1005][1005];
int vis[1005][1005];
int maxes[300005];
int mines[300005];
int maxn,minn;
int visn=1;
int maxl;
int n,m;
bool isbomb()
{
   // cout<<(clock()-start)/(double)CLOCKS_PER_SEC<<endl;
    if((clock()-start)/(double)CLOCKS_PER_SEC<=TL)return true;
    return false;
}
void add(int x)
{
   int uk1 = 0;
       int  uk2 = maxn;
       int mid;
        while(uk1<uk2)
        {
          //  cout<<uk1<<" "<<uk2<<endl;
         mid = (uk1+uk2)/2+1;
         if(maxes[mid]<x)uk1 = mid;
         else
            uk2 = mid-1;
            //cout<<uk1<<endl;
        }//cout<<"dd"<<endl;
        maxes[uk1+1] = x;
        maxn = max(maxn,uk1+1);
         uk1 = 0;
        uk2 = minn;
        while(uk1<uk2)
        {
         mid = (uk1+uk2)/2+1;
         if(mines[mid]>x)uk1 = mid;
         else
            uk2 = mid-1;
           // cout<<"  "<<uk1<<endl;
        }
        mines[uk1+1] = x;
        minn = max(minn,uk1+1);
}
void check()
{
    if(otg<maxn*minn)
    {
        otg = maxn*minn;
        while(!ans.empty())
            ans.pop();
        while(!tek.empty())
        {
            ans.push(tek.front());
            tek.pop();
        }
    }
    else
        while(!tek.empty())
        tek.pop();
}
bool tryit2(int &x, int &y,int &l)
{
    tek.push({x,y});
    vis[x][y]=visn;
    add(d[x][y]);
    int p=0,q=1;
     if(y>1&&vis[x][y-1]!=visn&&d[x][y-1]!=-1)
    {
        //if(d[p][q]<=d[x][y-1])
            {p=x;q=y-1;}
    }

 //   cout<<x<<" "<<y<<" "<<l<<endl;

 if(x<n&&vis[ x+1][y]!=visn&&d[x+1][y]!=-1)
    {
       //if(d[p][q]<=d[x+1][y])
            {p=x+1;q=y;}
    }
     if(y<m&&vis[x][y+1]!=visn&&d[x][y+1]!=-1)
    {
       // cout<<"OK"<<m<<" "<<y<<endl;
       // if(d[p][q]<=d[x][y+1])
            {p=x;q=y+1;}
    }
    if(x>1&&vis[x-1][y]!=visn&&d[x-1][y]!=-1)
    {
      //  if(d[p][q]<=d[x-1][y])
            {p=x-1;q=y;}
    }
   // cout<<p<<"**"<<q<<endl;

    if(p==0&&q==1||l==maxl||d[p][q]==-1)
    {
        check();
        return false;
    }
  x = p;
y = q;
l++;
return  true;
   // tryit(p,q,l+1);
}
bool tryit(int &x, int &y,int &l)
{
    tek.push({x,y});
    vis[x][y]=visn;
    add(d[x][y]);
    int p=0,q=0;
 //   cout<<x<<" "<<y<<" "<<l<<endl;
 if(y<m&&vis[x][y+1]!=visn&&d[x][y+1]!=-1)
    {
       // cout<<"OK"<<m<<" "<<y<<endl;
       // if(d[p][q]>=d[x][y+1] )
          {p=x;q=y+1;}
    }

     if(y>1&&vis[x][y-1]!=visn&&d[x][y-1]!=-1)
    {
        //if(d[p][q]>=d[x][y-1])
            {p=x;q=y-1;}
    } if(x>1&&vis[x-1][y]!=visn&&d[x-1][y]!=-1)
    {
       // if(d[p][q]>=d[x-1][y])
            {p=x-1;q=y;}
    }
     if(x<n&&vis[x+1][y]!=visn&&d[x+1][y]!=-1)
    {
        //if(d[p][q]>=d[x+1][y])
            {p=x+1;q=y;}
    }

   // cout<<p<<"**"<<q<<endl;


    if(p==0&&q==0||l==maxl||d[p][q]==-1)
    {
        check();
        return false;
    }
   x = p;
   y = q;
   l++;
   return true;
    //tryit2(p,q,l+1);
}
void vikai(int x, int y, int l)
{
    while(1)
    {
        if(! tryit(x,y,l))return ;


       if(! tryit2(x,y,l))return ;

    }
}
void print()
{
    //cout<<"OK"<<endl;
    cout<<ans.size()<<endl;
    while(!ans.empty()){
        cout<<ans.front().first<<" "<<ans.front().second<<endl;ans.pop();}
    return ;
}
int main()
{

ios_base::sync_with_stdio(false);
cin.tie(NULL);

freopen("path.out","w",stdout);
freopen("path.in","r",stdin);

    start = clock();
d[0][0]=1e9+7;
d[0][1]=0;
cin>>n>>m;
int i,j,t;
int br=0;
int mins = 1e9+7;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
    cin>>d[i][j];
    if(d[i][j]!=-1)
  mins = min(mins,d[i][j]);
}
cin>>maxl;
//cout<<n<<"&"<<m<<endl;
for(i=1;i<=n;i++)
{
    for(j=1;j<=m;j++)
    {//cout<<"OK"<<endl;
        if(!isbomb()){print();return 0;}
        if(d[i][j]!=-1){
               // cout<<i<<" "<<j<<endl;
                memset(maxes,0,sizeof(maxes));
       memset(mines,0,sizeof(mines));
minn = 0;
maxn = 0;
                visn++;vikai(i,j,1);}
    }
}
print();
return 0;

}