#include<bits/stdc++.h>
using namespace std;
namespace yqx{
int n,m;int s[5005],k[5005];
int ans=0,adv;
signed main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>s[i]>>k[i];
}
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
if(k[i]<k[j]){
swap(s[i],s[j]);
swap(k[i],k[j]);
}
else{
if((k[i]==k[j])&&(s[i]>s[j])){
swap(s[i],s[j]);
}
}
}
}
int op=floor(m*1.5);
adv=k[op];
for(int i=1;i<=n;i++){
if(k[i]>=adv){
ans++;
}
}
cout<<adv<<" "<<ans<<endl;
for(int i=1;i<=ans;i++){
cout<<s[i]<<" "<<k[i]<<endl;
}
}
}
signed main(){
return yqx::main();
}