//07/09/24 19:36
//07/09/24 20:37
#include <iostream>
#include <algorithm>
using namespace std;

struct student{
	string na;
	int sc;
} stu[1005];
//数组要开大一点，测试数据比较多 

bool cmpDec(student a,student b){
	return a.sc > b.sc;
}

bool cmpInc(student a,student b){
	return a.sc < b.sc;
}

int main(){
	int n,ord;
	while(cin>>n){
		//这里隐含了有多轮输入的内容 
		cin>>ord;
		for(int i = 0; i < n ; i++){
		cin>>stu[i].na>>stu[i].sc;
		}
		if(ord == 0){
			stable_sort(stu,stu+n,cmpDec);
		}
		else{
			stable_sort(stu,stu+n,cmpInc);
		}
		for(int i = 0; i < n; i++){
			cout<<stu[i].na<<' '<<stu[i].sc<<endl;
		}
	}
	
	return 0;
}