#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct rect
{
    ll bax,bay,jfx,jfy;
    rect(ll bax,ll bay,ll jfx,ll jfy) : bax(bax), bay(bay), jfx(jfx), jfy(jfy) {}
};

ll n,m,k,e;
vector<rect> rains;
ll best=-1;
ll bestx,besty;

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("Sivatag.txt","r",stdin);
    cin>>n>>m>>k>>e;
    for(ll i=1;i<=e;i++)
    {
        ll bax,bay,jfx,jfy;
        cin>>bax>>bay>>jfx>>jfy;
        rains.push_back(rect(bax,bay,jfx,jfy));
    }
    for(ll i=1;i<=n;i++)
    {
        ll xstart=i;
        ll xend=i+k-1;
        vector<ll> plusminus(m+2,0);
        for(rect r:rains)
        {
            if(max(xstart,r.bax)>min(xend,r.jfx)) continue;
            ll cover=min(xend,r.jfx)-max(xstart,r.bax)+1;
            plusminus[r.bay]+=cover;
            plusminus[r.jfy+1]-=cover;
        }
        vector<ll> perrow(m+1,0);
        vector<ll> pref(m+1,0);
        for(ll j=1;j<=m;j++) perrow[j]=perrow[j-1]+plusminus[j];
        for(ll j=1;j<=m;j++) pref[j]=pref[j-1]+perrow[j];
        for(ll j=1;j+k-1<=m;j++)
        {
            ll curr=pref[j+k-1]-pref[j-1];
            if(curr>best)
            {
                best=curr;
                bestx=i;
                besty=j;
            }
        }
    }
    cout<<best<<endl;
    cout<<bestx<<" "<<besty<<endl;
    return 0;
}