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

const int N=1e5+10;

struct stu{
    string id;
    string name;
    int score;
};

int n,c;
stu a[N];

bool cmp1(stu a,stu b)
{
    return a.id<b.id;
}

bool cmp2(stu a,stu b)
{
    if(a.name!=b.name)
    return a.name<b.name;
    return a.id<b.id;
}

bool cmp3(stu a,stu b)
{
    if(a.score!=b.score)
    return a.score<b.score;
    return a.id<b.id;
}

int main()
{
    while(cin>>n)
    {
        if(n==0)
        break;
        cin>>c;
        for(int i=0;i<n;i++)
        cin>>a[i].id>>a[i].name>>a[i].score;
        if(c==1)
        sort(a,a+n,cmp1);
        else if(c==2)
        sort(a,a+n,cmp2);
        else
        sort(a,a+n,cmp3);
        puts("Case:");
        for(int i=0;i<n;i++)
        cout<<a[i].id<<" "<<a[i].name<<" "<<a[i].score<<endl;
    }
    return 0;
}