#include<iostream>
#include<algorithm>
#include<vector>
#define n first
#define s second
using namespace std;

int n,t;

bool cmp1(pair<string,int> a,pair<string,int> b)
{
	return a.s<b.s;
}

bool cmp2(pair<string,int> a,pair<string,int> b)
{
	return a.s>b.s;
}

int main()
{
	while(cin>>n)
	{
		vector<pair<string,int>> a;
		cin>>t;
		for(int i=0;i<n;i++)
		{
			string name;
			int score;
			cin>>name>>score;
			a.push_back({name,score});
		}
		if(t)
			stable_sort(a.begin(),a.end(),cmp1);
		else
			stable_sort(a.begin(),a.end(),cmp2);
		for(int i=0;i<a.size();i++)
			cout<<a[i].n<<" "<<a[i].s<<endl;
	}
	return 0;
}