#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Student {
char name12;
char id12;
int grade;
};
bool cmp(Student a, Student b) {
return a.grade > b.grade;
}
int main() {
int n, low, high;
cin >> n;
vector<Student> students(n);
for(int i = 0; i < n; i++) {
cin >> studentsi.name >> studentsi.id >> studentsi.grade;
}
cin >> low >> high;
vector<Student> valid;
for(int i = 0; i < n; i++) {
if(studentsi.grade >= low && studentsi.grade <= high) {
valid.push_back(studentsi);
}
}
sort(valid.begin(), valid.end(), cmp);
if(valid.empty()) {
cout << "NONE";
} else {
for(int i = 0; i < valid.size(); i++) {
cout << validi.name << " " << validi.id << endl;
}
}
return 0;
}