#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int n, m, k, e, x1, y1, x2, y2;
ll cur, ans = 0;
vector <vector <int>> fen(501, vector<int>(501, 0));
vector <vector <ll>> pre(501, vector<ll>(501, 0));

void pref_update(int x, int y, int val) {
    for (int i = x; i >= 0; i = (i & (i + 1)) - 1) {
        for (int j = y; j >= 0; j = (j & (j + 1)) - 1) {
            fen[i][j] += val;
        }
    }
}

void update() {
    cin >> x1 >> y1 >> x2 >> y2;
    x1--; y1--;
    pref_update(x1, y1, 1);
    pref_update(x2, y2, 1);
    pref_update(x1, y2, -1);
    pref_update(x2, y1, -1);
}

int query(int x, int y) {
    int ret = 0;
    for (int i = x; i <= n; i = (i | (i + 1))) {
        for (int j = y; j <= m; j = (j | (j + 1))) {
            ret += fen[i][j];
        }
    }
    return ret;
}

int main()
{
    cin >> n >> m >> k >> e;
    for (int i = 0; i < e; i++) update();
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            pre[i][j] = query(i, j) + pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1];
            if (i < k || j < k) continue;
            cur = pre[i][j] - pre[i - k][j] - pre[i][j - k] + pre[i - k][j - k];
            if (cur > ans) { ans = cur; x1 = i - k + 1; y1 = j - k + 1; }
        }
    }
    cout << ans << endl << x1 << " " << y1;
}