#include <bits/stdc++.h> using namespace std; int n; struct node { int h,l,r; }pingtai[1005]; signed main() { cin >> n; for (int i = 1; i <= n; i++) cin >> pingtai[i].h >> pingtai[i].l >> pingtai[i].r; for (int i = 1; i <= n; i++) { int h1 = -0x3f3f3f3f,h2 = -0x3f3f3f3f; int h1id = 0,h2id = 0; for (int j = 1; j <= n; j++) { if (pingtai[j].h < pingtai[i].h) { if (pingtai[j].l < pingtai[i].l && pingtai[j].r >= pingtai[i].l) { if (h1 < pingtai[j].h) { h1id = j; h1 = pingtai[j].h; } } if (pingtai[j].r > pingtai[i].r && pingtai[j].l <= pingtai[i].r) { if (h2 < pingtai[j].h) { h2id = j; h2 = pingtai[j].h; } } } } printf("%d %d\n",h1id,h2id); } return 0; }