#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef struct people {
    int num = 0;
    int fen = 0;
};
bool cmp(people a, people b) {
    if (a.fen != b.fen ) {
        return a.fen > b.fen;
    }
    else
        return a.num < b.num;
    
}
int main() {
    int n, m;
    cin >> n >> m;
    people ppp[5000];
    
    people p;
    for (int i = 0; i < n; i++) {
        cin >> p.num >> p.fen;
        ppp[i].num = p.num;
        ppp[i].fen = p.fen;
    }
    sort(ppp, ppp + n, cmp);
    int k = 0;
    int t = m * 1.5;

    for (int i = 0; i < 5000; i++) {
        if ((ppp[i].fen) >= (ppp[t].fen)) {
            k++;
        }
    }
    cout << ppp[k-1].fen << " " << k << endl;
    for (int i = 0; i < k; i++) {
        cout << ppp[i].num << " " << ppp[i].fen << endl;
    }


    return 0;
}