#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
int main()
{
    long int n,m,i,j,sum=0;cin>>n>>m;
    long long a[n][m];
    for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
        {
            cin>>a[i][j];
        }
    }
    long int T;cin>>T;long long b[T][4],c[T],x[10000000]={0},y[10000000]={0};
    for(i=0;i<T;i++)
    {
        for(j=0;j<4;j++)
        {
            cin>>b[i][j];
        }
    }
    for(i=0;i<T;i++)
    { 
       c[i]=a[b[i][0]-1][b[i][1]-1];
       a[b[i][0]-1][b[i][1]-1]=a[b[i][2]-1][b[i][3]-1];
       a[b[i][2]-1][b[i][3]-1]=c[i];
        
    }
     for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
        {
            if(i==0&&j==0)
            {
                if(a[i][j]>a[i+1][j]&&a[i][j]>a[i][j+1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(i==0&&j==m-1)
            {
                if(a[i][j]>a[i+1][m-1]&&a[i][j]>a[i][m-2])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(i==0&&j!=0&&j!=m-1)
            {
                if(a[i][j]>a[1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(i==n-1&&j==0)
            {
                if(a[i][j]>a[i-1][0]&&a[i][j]>a[i][1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(i==n-1&&j==m-1)
            {
                if(a[i][j]>a[i-1][m-1]&&a[i][j]>a[i][m-2])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(i==n-1&&j!=0&&j!=m-1)
            {
                if(a[i][j]>a[i-1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(j==0&&i!=0&&i!=n-1)
            {
                if(a[i][j]>a[i+1][j]&&a[i][j]>a[i-1][j]&&a[i][j]>a[i][j+1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
           if(j==m-1&&i!=0&&i!=n-1)
            {
                if(a[i][j]>a[i+1][j]&&a[i][j]>a[i-1][j]&&a[i][j]>a[i][j-1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
            if(j>0&&j<m-1&&i>0&&i<n-1)
            {
                if(a[i][j]>a[i+1][j]&&a[i][j]>a[i-1][j]&&a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1])
                {
                    x[sum]=i+1;y[sum]=j+1;
                    sum=sum+1;
                }
            }
        }
    }
            cout<<sum<<'\n';
            for(i=0;i<10000000;i++)
            {
                if(x[i]!=0&&y[i]!=0)
                {
                    cout<<x[i]<<" "<<y[i];
                }
                if(i!=n-1)
                {
                    cout<<'\n';
                }
            }
          return 0;
            
        
    
    
    
    
}