include<bits/stdc++.h>

using namespace std; int n,sum; double m,sss; struct zyz{

int kh;
int fs;

}z[5005]; bool cmp(zyz a,zyz b) {

if(a.fs==b.fs&&a.kh<=b.kh)
{
	return a.kh<b.kh;
}

else

{
 	return a.fs>b.fs;
}

} int main(){

int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
	scanf("%d%d",&z[i].kh,&z[i].fs );
}
sort(z+1,z+1+n,cmp);
sss=m*1.5;
int fff=z[int(sss)].fs ;
for(int i=1;i<=n;i++)
{
	if(z[i].fs >=fff)
	{
		sum++;
	}
}
cout<<fff<<" "<<int(sum)<<endl;
for(int i=1;i<=sum;i++)
{
	cout<<z[i].kh <<" "<<z[i].fs <<endl;
}
return 0;//(功德圆满)

}