#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);

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

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

        vector<pair<int, int>> pts;

        for (auto [x1, y1, x2, y2] : p) {
            pts.emplace_back(x1, y1);
            pts.emplace_back(x2, y2);
            pts.emplace_back(x1, y2);
            pts.emplace_back(x2, y1);
        }

        int m = size(pts);
        vector<int> freq(m);

        for (auto &r : p) {
            for (int i = 0; i < m; ++i) {
                freq[i] += r.in(pts[i].first, pts[i].second);
            }
        }

        int i = max_element(freq.begin(), freq.end()) - freq.begin();
        cout << pts[i].first << " " << pts[i].second << '\n';
        vector<Rect> nxt;

        for (int j = 0; j < size(p); ++j) {
            if (!p[j].in(pts[i].first, pts[i].second)) {
                nxt.push_back(p[j]);
            }
        }

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

    dfs(dfs, r, k);

    return 0;
}