#include<bits/stdc++.h>
using namespace std;
struct node
{
int num;
int s;
};
node a[5001];
int n,m;
int cmp(node a,node b)
{
return (a.s>b.s)||(a.s==b.s&&a.num<b.num);
}
int main()
{
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>a[i].num>>a[i].s;
sort(a,a+n,cmp);
m=m*1.5;
int cnt=0;
for(int i=0;i<n;i++)
if(a[i].s>=a[m-1].s) cnt++;
cout<<a[m-1].s<<" "<<cnt<<endl;
for(int i=0;i<cnt;i++)
cout<<a[i].num<<" "<<a[i].s<<endl;
return 0;
}
using namespace std;
struct node
{
int num;
int s;
};
node a[5001];
int n,m;
int cmp(node a,node b)
{
return (a.s>b.s)||(a.s==b.s&&a.num<b.num);
}
int main()
{
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>a[i].num>>a[i].s;
sort(a,a+n,cmp);
m=m*1.5;
int cnt=0;
for(int i=0;i<n;i++)
if(a[i].s>=a[m-1].s) cnt++;
cout<<a[m-1].s<<" "<<cnt<<endl;
for(int i=0;i<cnt;i++)
cout<<a[i].num<<" "<<a[i].s<<endl;
return 0;
}