#include<bits/stdc++.h>
using namespace std;
int ans=0,ans1,xx[10000],yy[10000];
struct caoi{
	int x,y;
}j[10000];
bool cmp(caoi x1,caoi y1){
	if(x1.y!=y1.y)return x1.y>y1.y;
	else{
		if(x1.x<y1.x)return x1.x<y1.x;
		else return y1.x<x1.x;
	}
}
int main(){
	int n,m;
	cin>>n>>m;
	int f=m*1.5;
	for(int i=0;i<n;i++){
		cin>>j[i].x>>j[i].y;
	}
	sort(j,j+n,cmp);
	int min=j[0].y;
	for(int i=0;i<n;i++){
		if(j[i].y<=min&&ans<f){
			ans++;
			ans1++;
			xx[ans1]=j[i].x;
			yy[ans1]=j[i].y;
			min=j[i].y;
			continue;
		}
		if(j[i].y==min&&ans==f){
			ans1++;
			xx[ans1]=j[i].x;
			yy[ans1]=j[i].y;
		}
	}
	cout<<min<<" "<<ans1<<endl;
	for(int i=1;i<=ans1;i++){
		cout<<xx[i]<<" "<<yy[i]<<endl;
	}
	return 0;
}