#include<iostream>
#include<cmath>
using namespace std;
int n,m,bh[5005],fs[5005],FEN,SHU;
int main(){
cin>>n>>m;
for(int i=1;i<=n;++i)cin>>bh[i]>>fs[i];
SHU=floor(m*1.5);
for(int i=1;i<=n;++i){
for(int j=i+1;j<=n;++j){
if(fs[i]<fs[j]){
swap(fs[i],fs[j]);
swap(bh[i],bh[j]);
}else if(fs[i]==fs[j]&&bh[i]>bh[j]){
swap(bh[i],bh[j]);
}
}
}
for(int i=SHU+1;i<=n;++i){
if(fs[SHU]==fs[i])SHU++;
}
cout<<fs[SHU]<<" "<<SHU<<endl;
for(int i=1;i<=SHU;++i)
cout<<bh[i]<<" "<<fs[i]<<endl;
return 0;
}