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

int main(){
  struct student{
    string name;
    int score;
  };
  int num;
  int method;
  while(cin>>num>>method){
    vector<student> stu(num);
    for(int i=0;i<num;i++){
      cin>>stu[i].name>>stu[i].score;
    }
    // 按 method：1 升序，否则降序；lambda 需捕获 method
    stable_sort(stu.begin(),stu.end(),[method](const student &a,const student &b){
      return method==1 ? a.score<b.score : a.score>b.score;
    });
    for(student s:stu){
      cout<<s.name<<" "<<s.score<<"\n";
    }
  }
  return 0;
}