#include<stdio.h>
#include<string.h>
#include<queue>
#include<math.h>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<stack>
#define LL long long
using namespace std;
const int INF=0x3f3f3f3f;
const int N=2e5+10;
struct zy{
	int id;
	int ma;
}a[N];
int n,m,ans=0;
bool cmp(zy a1,zy a2){
	if(a1.ma==a2.ma)
		return a1.id<a2.id;
	return a1.ma>a2.ma;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i].id>>a[i].ma;
	}
	sort(a+1,a+n+1,cmp);
	m=m*1.5;
	int tmp=a[m].ma;
	for(int i=1;i<=n;i++){
		if(a[i].ma>=tmp)
			ans++;
		else
			break;
	}
	cout<<tmp<<" "<<ans<<endl;
	for(int i=1;i<=ans;i++)
		cout<<a[i].id<<" "<<a[i].ma<<" "<<endl;
	return 0;
}