#include<bits/stdc++.h>
using namespace std;
struct x{
    int id,t;
}k[5001];
bool cmp(x a,x b){
    if(a.t==b.t) return a.id<b.id;
    return a.t>b.t;
}
int n,m,jh,j=1;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
      scanf("%d%d",&k[i].id,&k[i].t);
    sort(k+1,k+1+n,cmp);
    jh=k[m*15/10].t;
    while(k[j].t>=jh) m++,j++;
    printf("%d %d\n",jh,m);
    for(int i=1;i<=m;i++)
      printf("%d %d\n",k[i].id,k[i].t);
    return 0;
}