#include<bits/stdc++.h>
using namespace std;
int num;
struct qwe{
	int q,w;
}a[50005];
bool comp(qwe x,qwe y)
{
	return x.w<y.w;
}
bool cmp(qwe c,qwe v)
{
	if(c.w==v.w)
	return c.q<v.q;
}
int main()
{
	int n,m;
	int qwe=0;
	cin>>n>>m;
	int ans=m*1.5;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].q>>a[i].w;
	}
	sort(a+1,a+1+n,comp);
	sort(a+1,a+1+n,cmp);
	for(int i=ans+1;i<=n;i++)
	{
		if(a[ans].w==a[i].w)
		num++;
	}
	qwe=num+ans;
	cout<<a[qwe].w<<" "<<qwe<<endl;
	for(int i=1;i<=qwe;i++)
	{
		cout<<a[i].q<<" "<<a[i].w<<endl;
	}
	return 0;
}