PAT-A1055

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct people{
	char name[10];
	int age,worth;
}peo[100010],valid[100010];
struct kkk{
	int k1,k2,k3;
}kk[1010];
bool cmp(people a, people b){
	if(a.worth!=b.worth)return a.worth>b.worth;
	else if(a.age!=b.age)return a.age<b.age;
	         else return strcmp(a.name,b.name)<0;
}
int age[100010]={0};
int main(){
int i, j, n, k, count=0;
scanf("%d%d",&n,&k);
for(i=0;i<n;i++){
	scanf("%s%d%d",peo[i].name,&peo[i].age,&peo[i].worth);
}
for(i=0;i<k;i++){
	scanf("%d%d%d",&kk[i].k1,&kk[i].k2,&kk[i].k3);
}
sort(peo,peo+n,cmp);
int index=0;
for(i=0;i<n;i++){
	if(age[peo[i].age]<100){ age[peo[i].age]++;valid[index++]=peo[i]; }
}

for(i=0;i<k;i++){
	count=0;
	printf("Case #%d:\n",i+1);
	for(j=0;j<index&&count<kk[i].k1;j++){
		if(valid[j].age>=kk[i].k2&&valid[j].age<=kk[i].k3)
		{printf("%s %d %d\n",valid[j].name,valid[j].age,valid[j].worth);  count++;}
	}
	if(count==0)printf("None\n");
}


return 0;
}