#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=5001;
struct stu{
	int num,score;
}player[maxn],pass[maxn];//suo you,ru xuan
int n,m,k=0,s=0,passi=1;
bool cmp(stu a,stu b){
	if(a.score==b.score) return a.num>b.num;
	else return a.score<b.score;
}
int main(){
	cin>>n>>m;
	k=m*1.5;
	for(int i=1;i<=n;i++){
		cin>>player[i].num>>player[i].score;
	}
	sort(player+1,player+n+1,cmp);
	s=player[k-1].score;
	for(int i=1;i<=n;i++){
		if(player[i].score>=s){
			pass[passi++]=player[i];
		}
	}
	cout<<s<<" "<<passi-1<<endl;
	for(int i=passi-1;i>=1;i--){
		cout<<pass[i].num<<" "<<pass[i].score<<endl;
	}
	return 0;
}

求改