#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
struct Student{
char name[15];
char id[15];
int grade;
}stu[10000010];
bool cmp(Student a,Student b){
return a.grade>b.grade;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s %s %d",stu[i].name,stu[i].id,&stu[i].grade);
}
int L,H;
scanf("%d %d",&L,&H);
sort(stu,stu+n,cmp);
int count=0;
for(int i=0;i<n;i++){
if(stu[i].grade<=H && stu[i].grade>=L){
printf("%s %s\n",stu[i].name,stu[i].id);
count++;
}
if(stu[i].grade<L){
break;
}
}
if(count==0){
printf("NONE\n");
}
return 0;
}