#include <bits/stdc++.h>
using namespace std;

struct node {
    string name;
    int score;
};

bool cmp_desc(node a, node b) {
    return a.score > b.score; 
}

bool cmp_asc(node a, node b) {
    return a.score < b.score; 
}

int main() {
    int n, ch;
    while (cin >> n >> ch) { 
        vector<node> a(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i].name >> a[i].score;
        }

        if (ch == 0) {
            stable_sort(a.begin(), a.end(), cmp_desc);
        } else {
            stable_sort(a.begin(), a.end(), cmp_asc); 
        }

        for (auto item : a) {
            cout << item.name << " " << item.score << endl;
        }
    }
    return 0;
}