#include <cmath>
#include <vector>
#include <climits>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
class GradeRecord {
public:
string name;
string id;
int grade;
};
bool compare1083(GradeRecord r1, GradeRecord r2) {
return r1.grade > r2.grade;
}
int main() {
int N, lower, higher;
cin >> N;
vector<GradeRecord> table(N);
for (int i = 0; i < N; i++) {
cin >> table[i].name >> table[i].id >> table[i].grade;
}
cin >> lower >> higher;
sort(table.begin(), table.end(), compare1083);
bool isPrint = false;
for (int i = 0; i < N; i++) {
if (table[i].grade >= lower && table[i].grade <= higher) {
cout << table[i].name << " " << table[i].id << endl;
isPrint = true;
}
}
if (!isPrint) {
cout << "NONE";
}
return 0;
}