#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

struct event {
	int x,h,t;
};

bool operator<(event e1, event e2) {
	if (e1.x==e2.x) return e1.t<e2.t;
	else return e1.x<e2.x;
}

int main() {
	int l,h,r,n=0;
	vector<event> events;
	while (scanf("%d %d %d",&l,&h,&r)==3) {
		events.push_back((event){l,h,1});
		events.push_back((event){r,h,-1});
		n++;
	}
	sort(events.begin(),events.end());
	multiset<int> heights;
	int i=0, prev=-1;
	vector<int> sky;
	while (i<events.size()) {
		int j=i;
		while (j<events.size() && events[j].x==events[i].x) {
			event e = events[j];
			if (e.t==-1) heights.erase(heights.find(e.h));
			else heights.insert(e.h);
			j++;
		}
		int h=0;
		if (!heights.empty()) h = *heights.rbegin();
		if (h!=prev) {
			if (prev!=-1) printf(" ");
			printf("%d %d",events[i].x,h);
			prev=h;
		}
		i=j;
	}
	printf("\n");
	return 0;
}