1

#include <bits/stdc++.h>
using namespace std;
struct peo{
    int k,s;
}as[5010];
bool cmp(peo a,peo b){
    if(a.s != b.s)return a.s > b.s;
    else return a.k < b.k;
}
int main(){
    int n,m,t = 0;
    cin >> n >> m;
    int nm = floor(m * 1.5);
    for(int i = 1;i <= n;i++){
        cin >> as[i].k >> as[i].s;
    }
    sort(as + 1,as + n + 1,cmp);
    for(int i = 1;i <= n;i++){
        if(as[i].s >= as[nm].s)t++;
    }
    cout << as[nm].s << ' ' << t << endl;
    for(int i = 1;i <= t;i++){
        cout << as[i].k << ' ' << as[i].s << endl;
    }
}