#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int n, k;

struct Person
{
    string name;
    int score;

    bool operator< (const Person& t) const
    {
        return score < t.score;
    }

    bool operator> (const Person& t) const
    {
        return score > t.score;
    }
}stu[N];



int main()
{
    cin >> n >> k;

    for(int i = 0; i < n; i ++ )
    {
        cin >> stu[i].name >> stu[i].score;
    }

    if (!k) stable_sort(stu, stu + n, greater<Person>());
    else stable_sort(stu, stu + n);

    for(int i = 0; i < n; i ++ ) cout << stu[i].name << ' ' << stu[i].score << endl;

    return 0;
}