#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
const int maxn = 10010;
struct student {
string name,id;
int scr;
}stu[maxn];
bool cmp(student &a, student &b) {
return a.scr > b.scr;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> stu[i].name >> stu[i].id >> stu[i].scr;
}
sort(stu, stu + n, cmp);
int amin, amax,cnt=0;
cin >> amin >> amax;
if (amin > stu[0].scr) {
printf("NONE\n");
return 0;
}
else if (amax < stu[n - 1].scr) {
printf("NONE\n");
return 0;
}
else {
for (int i = 0; i < n; i++) {
if (stu[i].scr >= amin && stu[i].scr <= amax) {
cout << stu[i].name <<" "<< stu[i].id << endl;
}
}
}
return 0;
}