#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
struct student{
string name, id;
int score;
};
bool comp(student a, student b){ return a.score > b.score;}
int main()
{
int N, grade1, grade2;
cin>>N;
vector<student> s(N);
for(int i = 0; i < N; i++)
cin>>s[i].name>>s[i].id>>s[i].score;
sort(s.begin(), s.end(), comp);
auto begin_itr = s.begin();
cin>>grade1>>grade2;
while(begin_itr -> score > grade2 && begin_itr != s.end())
begin_itr ++;
auto end_itr = begin_itr;
while(end_itr -> score >= grade1 && end_itr != s.end())
end_itr ++;
if(begin_itr == end_itr){
cout<<"NONE"<<endl;
return 0;
}
for(auto itr = begin_itr; itr != end_itr; itr++)
cout<<itr->name<<" "<<itr->id<<endl;
}