#include<bits/stdc++.h>
using namespace std;
int n,m;
int cnt=0;
struct luqu{
	int id,sco;
}a[6000],b[6000];
int fsx;
bool cmp(luqu x,luqu y){
	return x.sco>y.sco;
}
bool comp(luqu x,luqu y){
	if(x.sco!=y.sco) return x.sco>y.sco;
	else return x.id<y.id;
}
int main(){
	cin>>n>>m;
	fsx=m*1.5;
	for(int i=1;i<=n;i++){
		cin>>a[i].id>>a[i].sco;
		if(a[i].sco!=a[i-1].sco){
			b[i].id=a[i].id;
		    b[i].sco=a[i].sco;
		}
	}
	sort(b+1,b+n+1,cmp);
	fsx=b[fsx].sco;
	sort(a+1,a+n+1,comp);
	int i=1;
	cout<<fsx<<" ";
	while(a[i].sco>=fsx){
		cnt++;
		i++;
	}
	cout<<cnt<<endl;
	for(int i=1;i<=cnt;i++){
		cout<<a[i].id<<" "<<a[i].sco<<endl;
	}
	return 0;
}