PAT A1055

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

struct Person{
    char name[15];
    int age;
    int wealth;
}people[100010];

bool cmp(Person a,Person b)
{
    if(a.wealth!=b.wealth) return a.wealth>b.wealth;
    else if(a.age!=b.age) return a.age<b.age;
    else if(strcmp(a.name,b.name)!=0) return strcmp(a.name,b.name)<0;
}

int main(void)
{
    int n,query;
    cin>>n>>query;
    for(int i=0;i<n;i++)
    {
        scanf("%s %d %d",people[i].name,&people[i].age,&people[i].wealth);
    }
    sort(people,people+n,cmp);
    for(int i=1;i<=query;i++)
    {
        int m,min,max;
        bool print=false;
        cin>>m>>min>>max;
        printf("Case #%d:\n",i);
        for(int i=0;i<n&&m>0;i++)
        {
            if(people[i].age>=min&&people[i].age<=max) 
            {
                printf("%s %d %d\n",people[i].name,people[i].age,people[i].wealth);
                m--;
                print=true;
            }
        }
        if(print==false) printf("None\n");
    }
}