#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct Rect {
    int x1, y1, x2, y2;

    bool in(int x, int y) {
        return x1 <= x && x <= x2 && y1 <= y && y <= y2;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k;
    cin >> n >> k;

    vector<Rect> r(n);
    vector<int> yy, xx;

    for (auto &[x1, y1, x2, y2] : r) {
        cin >> x1 >> y1 >> x2 >> y2;
        yy.push_back(y1), yy.push_back(y2);
        xx.push_back(x1), xx.push_back(x2);
    }

    sort(xx.begin(), xx.end());
    sort(yy.begin(), yy.end());
    xx.resize(unique(xx.begin(), xx.end()) - xx.begin());
    yy.resize(unique(yy.begin(), yy.end()) - yy.begin());

    for (auto &[x1, y1, x2, y2] : r) {
        x1 = lower_bound(xx.begin(), xx.end(), x1) - xx.begin();
        x2 = lower_bound(xx.begin(), xx.end(), x2) - xx.begin();
        y1 = lower_bound(yy.begin(), yy.end(), y1) - yy.begin();
        y2 = lower_bound(yy.begin(), yy.end(), y2) - yy.begin();
    }

    int sx = size(xx), sy = size(yy);

    auto dfs = [&](auto self, vector<Rect> p, int cnt) -> void {
        if (cnt == 0) {
            if (!p.empty()) {
                exit(0);
            }
            assert(p.empty());
            return;
        } else if (p.empty()) {
            cout << "1 1\n";
            self(self, p, cnt - 1);
            return;
        }

        vector f(sx + 1, vector<int>(sy + 1));

        for (auto [x1, y1, x2, y2] : p) {
            f[x1][y1] += 1;
            f[x1][y2 + 1] -= 1;
            f[x2 + 1][y1] -= 1;
            f[x2 + 1][y2 + 1] += 1;
        }

        int mx = -1, x = 0, y = 0;

        for (int i = 0; i < size(f); ++i) {
            for (int j = 0; j < size(f[i]); ++j) {
                if (i > 0) {
                    f[i][j] += f[i - 1][j];
                }
                if (j > 0) {
                    f[i][j] += f[i][j - 1];
                }
                if (i > 0 && j > 0) {
                    f[i][j] -= f[i - 1][j - 1];
                }
                if (f[i][j] > mx) {
                    mx = f[i][j];
                    x = i, y = j;
                }
            }
        }

        vector<Rect> nxt;
        
        cout << xx[x] << " " << yy[y] << '\n';

        for (int j = 0; j < size(p); ++j) {
            if (!p[j].in(x, y)) {
                nxt.push_back(p[j]);
            }
        }

        self(self, nxt, cnt - 1);
    };

    dfs(dfs, r, k);

    return 0;
}