#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
struct People{
char name[10];
int age;
int money;
}peo[100010];
bool cmp(People a,People b){
if(a.money!=b.money) return a.money>b.money;
else if(a.age!=b.age) return a.age<b.age;
else return strcmp(a.name,b.name)<0;
}
int main()
{
int n,k;
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++){
scanf("%s %d %d",peo[i].name,&peo[i].age,&peo[i].money);
}
sort(peo,peo+n,cmp);
for(int i=0;i<k;i++){
int L,H,num;
scanf("%d%d%d",&num,&L,&H);
printf("Case #%d:\n",i+1);
int count=0;
for(int j=0;j<n;j++){
if(count==num){
break;
}
if(peo[j].age>=L && peo[j].age<=H){
printf("%s %d %d\n",peo[j].name,peo[j].age,peo[j].money);
count++;
}
}
if(count==0) printf("None\n");
}
return 0;
}