#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int n,m;
struct node{
	int k;//考号
	int s;//成绩
}arr[5005];
bool cmp(node n1,node n2){
	if(n1.s!=n2.s) return n1.s>n2.s;
	else return n1.k<n2.k;
}
int main(){
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		cin >> arr[i].k >> arr[i].s; 
	}
	stable_sort(arr+1,arr+1+n,cmp);
	int tmp = m*1.5/1;
	int pointline = arr[tmp].s;
	cout << pointline << ' ';
	int res=0;
	for(int i=1;i<=n;i++){
		if(arr[i].s>=pointline){
			res++;
		}
	}
	cout << res << '\n';
	for(int i=1;i<=res;i++){
		cout << arr[i].k << ' ' << arr[i].s << '\n';
	}
	return 0;
}