#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int N(5009);
struct stu{
	int no;int scr;
};
stu p[N];
bool comp(const stu &x,const stu &y)
{
	if(x.scr!=y.scr)
		return x.scr>y.scr;
	else
		return x.no<y.no;
}
int main()
{
	int n,m,line,ans(0);
	cin>>n>>m;
	int num(floor(m*1.5));
	for(int i=1;i<=n;i++)
		cin>>p[i].no>>p[i].scr;
	sort(p+1,p+n+1,comp);
	line=p[num].scr;
	ans+=num;
	for(int i=num+1;p[i].scr>=line;i++)
		ans++;
	cout<<line<<" "<<ans<<endl;
	for(int i=1;i<=ans;i++)
		printf("%d %d\n",p[i].no,p[i].scr);
	return 0;
}
/**************************************************************
	Problem: 2285
	User: admin
	Language: C++
	Result: Accepted
	Time:59 ms
	Memory:2116 kb
****************************************************************/