#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<stack>
#include<deque>
#include<map>
using namespace std;
struct node
{
	int hm;
	int cz;
}s[5005];
bool cmp(node x,node y)
{
	if(x.cz>y.cz) return 1;
	if(x.cz==y.cz&&x.hm<y.hm) return 1;
	if(x.cz<y.cz) return 0;
}
int main()
{
	int n,M;
	double m;
	cin>>n>>m;
	m*=1.5;
	M=m;
	if(M>n) M=n;
	for(int i=1;i<=n;i++)
	{
		cin>>s[i].hm>>s[i].cz;
	}
	sort(s+1,s+n+1,cmp);
	int t=M;
	for(int i=M+1;;i++)
	{
		if(s[i].cz!=s[t].cz) break;
		M++;
	}
	cout<<s[M].cz<<" "<<M<<endl;
	for(int i=1;i<=M;i++)
	{
		cout<<s[i].hm<<" "<<s[i].cz<<endl;
	}
	return 0;
}