#include<iostream>
#include <algorithm>
using namespace std;
struct stu {
	int num , sco;
};
bool cmp(stu a , stu b) {
	return a.sco>b.sco;
}
int main() {
	int n , m ,index , ans;
	cin>>n>>m;
	struct stu arr[n+2];
	for(int i = 1 ; i <= n ; i++) {
		cin>>arr[i].num>>arr[i].sco;
	}
	sort(arr+1,arr+n+1,cmp);
	for(int i = 1 ; i < n ; i++) {
		if(arr[i].sco == arr[i+1].sco && arr[i].num > arr[i+1].num) {
			swap(arr[i].num,arr[i+1].num);
		}
	}
	index = m * 3/2;
	for(int i = 1 ; i <= n ; i++) {
		if(arr[i].sco >= arr[index].sco) {
			ans++;
		}
	}
	cout<<arr[index].sco<<" "<<ans<<endl;
	for(int i = 1 ; i <= ans ; i++) {
		cout<<arr[i].num<<" "<<arr[i].sco<<endl;
	}
	return 0;
}