#include <bits/stdc++.h>
using namespace std;
struct zhiyuan{
    int socer, id;
}a[5010];
int n, m;
bool cmp(zhiyuan a, zhiyuan b){
    if (a.socer != b.socer)
        return a.socer > b.socer;
    return a.id < b.id;
}
int main(){
    cin >> n >> m;
    for (int i = 0; i < n; i++){
        cin >> a[i].id >> a[i].socer;
    }
    sort(a, a + n, cmp);
    m *= 1.5;
    int ac = a[m].socer, js = 0;
    for (int i = 0; i < n; i++)
        if (a[i].socer < ac)
            break;
        else
            js++;
    cout << ac << " " << js << endl;
    for (int i = 0; i < n; i++)
        if (a[i].socer < ac)
            break;
        else
            cout << a[i].id << " " << a[i].socer << endl;
}