#include <bits/stdc++.h>
using namespace std;
int n,m,fsx,jsq;
struct ks{
	int h;
	int fs;
} a[5010],ksrs[5010]; 
bool cmp(ks x,ks y){
	return x.fs>y.fs || x.fs==y.fs && x.h<y.h; 
}
int main()
{
	cin >>n >>m;
	for(int i=1;i<=n;i++){
		cin >>a[i].h >>a[i].fs;
	}
	sort(a+1,a+1+n,cmp);
	fsx=a[(int)floor(m/100.0*150)].fs;
	cout <<fsx <<" ";
	int ii=0;
	for(int i=m;;i++){
		if(a[i].fs!=a[i+1].fs){
			ii=i;
		}
		else{
			break;
		}
	}
	cout <<ii+m-1 <<endl;
	jsq=ii+m-1;
	ii=0;
	while(ii<jsq){
		ii++;
		cout <<a[ii].h <<" " <<a[ii].fs <<endl;
	}
	return 0;
}