#include <iostream>
#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;
ifstream in("nume.in");
ofstream out("heapuri.out");

struct name{
int t,s;}v[101];

bool cmp(name a,name b)
{
return (a.s<b.s)||(a.s==b.s&&a.t<b.t);
}
int main()
{
    in>>n>>d;
    for(int i=1;i<=n;i++){
       in>>v[i].t>>v[i].s;
    }
    sort(v+1,v+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        cout<<v[i].t<<" "<<v[i].s<<endl;
    }
    return 0;
}