#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1e5;
struct Node
{
int id;
char name[10];
int grade;
} students[N+5];
int c;
bool cmp(Node &a,Node &b)
{
if(c==2&&strcmp(a.name,b.name)!=0)
return strcmp(a.name,b.name)<0;
else if(c==3&&a.grade!=b.grade)
return a.grade<b.grade;
return a.id<b.id;
}
int main()
{
int n;
scanf("%d%d",&n,&c);
for(int i = 0; i<n; ++i)
scanf("%d %s %d",&students[i].id,students[i].name,&students[i].grade);
sort(students,students+n,cmp);
for(int i = 0; i<n; ++i)
printf("%06d %s %d\n",students[i].id,students[i].name,students[i].grade);
return 0;
}