#include<bits/stdc++.h>
using namespace std;
int n,m,special=0;
struct node{
	int number,score;
}people[5010];
bool cmp(node a,node b){
	if(a.score==b.score)
		return a.number<b.number;
	else return a.score>b.score;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d%d",&people[i].number,&people[i].score);
	sort(people+1,people+n+1,cmp);
	for(int i=int(m*1.5)+1;i<=n;i++)
		if(people[i].score==people[i-1].score)
			special++;
	printf("%d %d\n",people[int(m*1.5)].score,int(m*1.5+special));
	for(int i=1;i<=int(m*1.5+special);i++)
		printf("%d %d\n",people[i].number,people[i].score);
	return 0;
}