#include<bits/stdc++.h>
#define int long long
using namespace std;
map<int,int> mp;
map<int,int> mp2;
int n,m,sum;
int lq,q;
int key[5005],value[5005],value2[5005];
struct node
{
	int num,f;
};
node ans[5005];
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>key[i]>>value[i];
		mp[value[i]]=key[i];
	}
	for(int i=1;i<=n;i++)
	{
		value2[i]=value[i];
	}
	sort(value2+1,value2+1+n,greater<int>());
	q=floor(m*1.5);
	lq=value2[q];
	for(int i=1;i<=n;i++)
	{
		if(mp[value2[i]]>=lq)
		{			
			sum++;				
			mp2[value2[i]]=mp[value2[i]];
		}
	}
	cout<<lq<<" "<<sum-1<<endl;
	for(auto i:mp2)
	{
		ans[i].f=i.first;
		ans[i].num=i.second;
	}
	for(int i=sum;i>=1;i--)
	{
		cout<<ans[i].num<<" "<<ans[i].f<<endl;
	}
	return 0;
}

$I\ need\ help!$