#include<bits/stdc++.h>
using namespace std;
int n,m;
struct Node{
	int k,s;
}a[5050];
bool cmp(Node a,Node b){
	return a.s>b.s;
}
int main(){
	int i;
	cin>>n>>m;
	m*=1.5;
	for(i=1;i<=n;i++) cin>>a[i].k>>a[i].s;
	sort(a+1,a+1+n,cmp);
	while(a[m].s==a[m+1].s) m++;
	cout<<a[m].s<<" "<<m<<endl;
	for(i=1;i<=m;i++) cout<<a[i].k<<" "<<a[i].s<<endl;
	return 0;
}