#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int n,m,k,nr,dmax,d,x1,x2,y1,y2;
bool a[200][200];
int v[200*200+1];


ifstream f("copaci.in");
ofstream g("copaci.out");

void solve(){
    f>>m>>n>>k;
    for(int i=1;i<=k;i++){
        int x,y;
        f>>x>>y;
        a[x][y]=1;
        v[i]=m*(y-1)+x;
    }
    sort(v+1,v+k+1);

    for(int i=1;i<k;i++){
        d=v[i+1]-v[i]-1;
        dmax=max(d,dmax);
    }
    g<<dmax<<'\n';
    for(int i=1;i<k;i++){
        d=v[i+1]-v[i]-1;
        if(d==dmax){
            x1=(v[i]-1)%m+1;
            y1=(v[i]-1)/m+1;
            x2=(v[i+1]-1)%m+1;
            y2=(v[i+1]-1)/m+1;
            g<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<'\n';
        }
    }

}


int main()
{

    solve();
    return 0;
}