#include<bits/stdc++.h>
using namespace std;
struct node{
int id,s;
}a[5000];
int n,m,cnt[111];
bool cmp(node a,node b){
if (a.s==b.s){
return a.id<b.id;
}
return a.s>b.s;
}
int main(){
cin>>n>>m;
m=floor(m*1.5);
for (int i=1;i<=n;++i){
cin>>a[i].id>>a[i].s;
cnt[a[i].s]+=1;
}
sort(a+1,a+1+n,cmp);
int g=-1,num=0;
for (int i=100;i>=0;--i){
if (m>cnt[i]){
m-=cnt[i];
num+=cnt[i];
}else{
g=i;
num+=cnt[i];
break;
}
}
cout<<g<<" "<<num<<endl;
for (int i=1;i<=num;++i){
cout<<a[i].id<<" "<<a[i].s<<endl;
}
}
