#include<bits/stdc++.h>
using namespace std;
//#define int long long
//#define mod 1000000007
#define N 200005
//#define pii pair<int,int>
//#define fi first
//#define se second
//#define rep(i,j,k) for(int i=j;i<=k;i++)
int n,k;
struct node{int a,b,c,d;}a[N],b[8];
node mer(node x,node y){return {max(x.a,y.a),min(x.b,y.b),max(x.c,y.c),min(x.d,y.d)};}
bool chk(node x,node y){node op=mer(x,y);return op.a<=op.b&&(op.c<=op.d);}
mt19937 rd(random_device{}());
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++)cin>>a[i].a>>a[i].c>>a[i].b>>a[i].d;
	while(1){
		for(int i=1;i<=k;i++)b[i]=a[i];
		for(int i=k+1;i<=n;i++){
			for(int j=1;j<=k;j++){
				if(chk(b[j],a[i])){
					b[j]=mer(b[j],a[i]);
					goto qwq;
				}
			}
			swap(a[i],a[rd()%(i-1)+1]);
			goto nt;
			qwq:;
		}
		for(int i=1;i<=k;i++){
			cout<<b[i].a<<' '<<b[i].c<<'\n';
		}
		return 0;
		nt:;
	}
	return 0;
}