#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
vector<pair<int,int>> arr;
 
bool sortfunc(const pair<int,int> &a,const pair<int,int> &b){
    if(a.first < b.first){
        return a.first > b.first;
    }
    else if(a.first == b.first){
        return a.second < b.second;
    }
}
 
int main(){
    int result = 0;
    int n, l ,k;
    cin >> n >> l >> k;
    for(int i = 0; i < n; i++){
        int sub1, sub2;
        cin >> sub1 >> sub2;
        arr.push_back(make_pair(sub1,sub2));
    }
    sort(arr.begin(),arr.end(),sortfunc);
    for(int i = 0; i < n ; i++){
        cout << arr[i].first <<' ' << arr[i].second << endl;
    }
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZlY3RvcjxwYWlyPGludCxpbnQ+PiBhcnI7Cgpib29sIHNvcnRmdW5jKGNvbnN0IHBhaXI8aW50LGludD4gJmEsY29uc3QgcGFpcjxpbnQsaW50PiAmYil7CiAgICBpZihhLmZpcnN0IDwgYi5maXJzdCl7CiAgICAgICAgcmV0dXJuIGEuZmlyc3QgPiBiLmZpcnN0OwogICAgfQogICAgZWxzZSBpZihhLmZpcnN0ID09IGIuZmlyc3QpewogICAgICAgIHJldHVybiBhLnNlY29uZCA8IGIuc2Vjb25kOwogICAgfQp9CgppbnQgbWFpbigpewogICAgaW50IHJlc3VsdCA9IDA7CiAgICBpbnQgbiwgbCAsazsKICAgIGNpbiA+PiBuID4+IGwgPj4gazsKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspewogICAgICAgIGludCBzdWIxLCBzdWIyOwogICAgICAgIGNpbiA+PiBzdWIxID4+IHN1YjI7CiAgICAgICAgYXJyLnB1c2hfYmFjayhtYWtlX3BhaXIoc3ViMSxzdWIyKSk7CiAgICB9CiAgICBzb3J0KGFyci5iZWdpbigpLGFyci5lbmQoKSxzb3J0ZnVuYyk7CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbiA7IGkrKyl7CiAgICAgICAgY291dCA8PCBhcnJbaV0uZmlyc3QgPDwnICcgPDwgYXJyW2ldLnNlY29uZCA8PCBlbmRsOwogICAgfQp9

OCA3IDUKMSAzCjIgNAozIDYKNCA4CjUgOAo2IDkKNiA3CjcgMTA=

8 7 5
1 3
2 4
3 6
4 8
5 8
6 9
6 7
7 10