#include<bits/stdc++.h>
using namespace std;
int n,m,i,sco,k,s=0;
struct node{
int k;
int score;
}a[10001];
bool cmp(node x,node y)
{
if(x.score!=y.score)
return x.score>y.score;
else
{
return x.k<y.k;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout<<fixed;
cin>>n>>m;
for(i=0;i<n;i++)
{
cin>>a[i].k>>a[i].score;
}
sort(a,a+n,cmp);
k=int(m*1.5);
sco=a[k].score;
cout<<sco<<" ";
for(i=0;i<n;i++)
{
if(a[i].score>=sco)
{
s++;
}
}
cout<<s<<"\n";
for(i=0;i<n;i++)
{
if(a[i].score<sco)
{
break;
}
else
{
cout<<a[i].k<<" "<<a[i].score<<"\n";
}
}
return 0;
}