#include <bits/stdc++.h>
#include <cassert>

using namespace std;

#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

pair<int, int> inters(pair<int, int> A, pair<int, int> B) {
    return {max(A.first, B.first), min(A.second, B.second)};
}

void solve() {
    int n, k; cin >> n >> k;
    vector<array<int, 4>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2] >> a[i][3];
        // left down right up
    }
    int minright = -1, maxleft = 1e9 + 1, minup = 1e9 + 1, maxdown = -1;
    for (int i = 0; i < n; i++) {
        minright = min(minright, a[i][2]);
        maxleft = max(maxleft, a[i][0]);
        maxdown = max(maxdown, a[i][1]);
        minup = min(minup, a[i][3]);
    }
    if (minright >= maxleft) {
        vector<int> used(n, 0);
        vector<pair<int, int>> ans;
        while (true) {
            int minu = 1e9 + 1, ps = -1;
            for (int i = 0; i < n; i++) {
                if (!used[i] && minu > a[i][3]) {
                    minu = a[i][3]; ps = i;
                }
            }
            if (ps == -1) break;
            ans.pb({minright, minu});
            for (int j = 0; j < n; j++) {
                if (a[j][1] <= minu && minu <= a[j][3]) {
                    used[j] = 1;
                } 
            }
        }
        for (auto u : ans) cout << u.first << ' ' << u.second << '\n';
        for (int i = 0; i < k - sz(ans); i++) cout << ans[0].first << ' ' << ans[0].second << '\n';
        return;
    }
    if (minup >= maxdown) {
        vector<int> used(n, 0);
        vector<pair<int, int>> ans;
        while (true) {
            int minu = 1e9 + 1, ps = -1;
            for (int i = 0; i < n; i++) {
                if (!used[i] && minu > a[i][2]) {
                    minu = a[i][2]; ps = i;
                }
            }
            if (ps == -1) break;
            ans.pb({minu, minup});
            for (int j = 0; j < n; j++) {
                if (a[j][0] <= minu && minu <= a[j][2]) {
                    used[j] = 1;
                } 
            }
        }
        for (auto u : ans) cout << u.first << ' ' << u.second << '\n';
        for (int i = 0; i < k - sz(ans); i++) cout << ans[0].first << ' ' << ans[0].second << '\n';
        return;
    }
    assert(k >= 2);
    int posr = -1, posl = -1;
    for (int i = 0; i < n; i++) {
        if (a[i][2] == minright) posr = i;
        if (a[i][0] == maxleft) posl = i;
    }
    vector<pair<int, int>> segs_left, segs_right;
    for (int i = 0; i < n; i++) {
        if (i != posl && i != posr) {
            auto lolleft = inters({a[posr][1], a[posr][3]}, {a[i][1], a[i][3]}), lolright = inters({a[posl][1], a[posl][3]}, {a[i][1], a[i][3]});
            segs_left.pb(lolleft);
            segs_right.pb(lolright);
        }
    }
    if (segs_left.size() == n - 2 && segs_right.size() == n - 2) {
        if (segs_left.empty()) {
            for (int i = 0; i < n; i++) cout << a[i][0] << ' ' << a[i][1] << '\n';
            for (int j = 0; j < k - n; j++) cout << a[0][0] << ' ' << a[0][1] << '\n';
            return;
        }
        multiset<int> Ls, Rs;
        for (int i = 0; i < sz(segs_right); i++) {
            Ls.insert(segs_right[i].first); Rs.insert(segs_right[i].second);
        }
        if (*Ls.rbegin() <= *Rs.begin()) {
            cout << minright << ' ' << 1 << '\n' << maxleft << ' ' << *Ls.rbegin() << '\n';
            for (int jj = 0; jj < k - 2; jj++) cout << 1 << ' ' << 1 << '\n';
            return;
        }
        vector<pair<int, int>> events;
        for (int i = 0; i < sz(segs_left); i++) {
            events.pb({segs_left[i].first, i});
            events.pb({segs_left[i].second + 1, i});
        }
        sort(all(events));
        vector<int> usedd(sz(segs_left), 0);
        int i = 0;
        while (i < sz(events)) {
            int j = i;
            while (j < sz(events) && events[j].first == events[i].first) {
                if (usedd[events[j].second] == 1) {
                    Ls.insert(segs_right[events[j].second].first);
                    Rs.insert(segs_right[events[j].second].second);
                } else {
                    Ls.erase(Ls.find(segs_right[events[j].second].first));
                    Rs.erase(Rs.find(segs_right[events[j].second].second));
                    usedd[events[j].second] = 1;
                }
                j++;
            }
            if (Ls.empty() || *Ls.rbegin() <= *Rs.begin()) {
                cout << minright << ' ' << events[i].first << '\n' << maxleft << ' ' << *Ls.rbegin() << '\n';
                for (int jj = 0; jj < k - 2; jj++) cout << 1 << ' ' << 1 << '\n';
                return;
            }
            i = j;
        }
    }
    //else assert(k >= 3);
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else 
        cin.tie(0)->sync_with_stdio(false);
    #endif

    while (tt--) {
        solve();
    }
    return 0;
}