#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef struct P
{
string name, no;
int g;
}P;
vector<P> p;
P x;
bool cmp(P a, P b)
{
return a.g > b.g;
}
int main()
{
int n, a, b;
while(cin >> n)
{
for(int i = 0; i < n; i++)
{
cin >> x.name >> x.no >> x.g;
p.push_back(x);
}
cin >> a >> b;
sort(p.begin(), p.end(), cmp);
int f = 0;
for(int i = 0; i < n; i++)
{
if(p[i].g >= a && p[i].g <= b)
f = 1, cout << p[i].name << " " << p[i].no << endl;
}
if(f == 0)
cout << "NONE" << endl;
p.clear();
}
return 0;
}