#include<bits/stdc++.h>

using namespace std;

int n,f,q,cnt;
double m,z;
struct node
{
	int id;
	int score;
};
node a[6000];
bool cmp(node x,node y)
{
	if(x.score == y.score ) return x.id < y.id; //woshibengua
	return x.score  > y.score;
}
int main()
{
	cin >> n >> m;
	f = floor(m * 1.5);
	for(int i = 0;i < n;i++)
	{
		cin >> a[i].id >> a[i].score;
	}
	sort(a , a + n , cmp);
	q = a[f].score;
	for(int i = 0;i < n;i++)
	{
		if(a[i].score >= q)
		{
			cnt++;
		}
	}
	cout << q << " " << cnt << endl;
	
	for(int i = 0;i < n;i++)
	{
		if(a[i].score >= q)
		{
			cout << a[i].id << " " << a[i].score << endl;
		}
	}
	return 0;
}