1028

版权声明：// Copyright © 2018年 Coding18. All rights reserved. https://blog.csdn.net/Coding18/article/details/86179961

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int n,c;
struct student{
	int id;
	char name[12];
	int g;
}stu[maxn];
bool cmp1(student a,student b)
{
	return a.id < b.id;
} 
bool cmp2(student a,student b)
{
	if(strcmp(a.name,b.name) != 0) return strcmp(a.name,b.name) < 0;
	return a.id < b.id;
} 
bool cmp3(student a,student b)
{
	if(a.g != b.g) return a.g < b.g;
	return a.id < b.id;
} 
int main()
{
	scanf("%d %d",&n,&c);
	for(int i = 0; i < n; i++)
	{
		scanf("%d %s %d",&stu[i].id,stu[i].name,&stu[i].g);
	}
	if(c == 1) sort(stu,stu+n,cmp1);
	else if(c == 2) sort(stu,stu+n,cmp2);
	else sort(stu,stu+n,cmp3);
	for(int i = 0; i < n; i++)
	{
		printf("%06d %s %d\n",stu[i].id,stu[i].name,stu[i].g);
	}
	return 0;
}