#include<bits/stdc++.h>
using namespace std;

struct ren{
	int hao, tot;
}a[5000];
bool tmp(ren x, ren y){
	return x.tot > y.tot;
}
int main(){
	int n, m;
	cin >> n >> m;
	int fenshuxian = floor(m*1.5), renshu = 0;
	for (int i = 0; i < n; i++){
		cin >> a[i].hao >> a[i].tot;
	}
	fenshuxian = a[fenshuxian+1].tot;
	sort(a, a+n, tmp);
	for (int i = 0;i < n; i++){
		if (a[i].tot >= fenshuxian) renshu++;
		if (a[i].tot < fenshuxian) break;
	}
	printf("%d %d", fenshuxian, renshu);
	for (int i = 0;i < renshu; i++){
		printf("%d %d\n", a[i].hao, a[i].tot);
	}
}

希望大佬能指出错误