#include <algorithm>
#include <iostream>
using namespace std;

struct score {
  int  id,  fs;
}a[5005];

bool cmp(score x, score y)
{
   if (x.fs != y.fs)
      return x.fs > y.fs;
   else
      return x.id < y.id;
}

int main()
{
   int n, num;

   cin >> n >> num;   // n=6; num = 3;
   num *=1.5;        //num = int(num * 1.5);     num = 4;
   
   for (int i= 1; i<=n; i++)
      cin >> a[i].id >> a[i].fs;
   
   sort(a+1, a+n+1, cmp);
   
   int j = num;

   do{
      j++;
} while (a[j].fs == a[num].fs && j<=n);
   
   cout << a[j-1].fs <<" "<< j-1 << endl;
   for (int i=1; i<=j-1; i++)
       cout << a[i].id<< ' ' << a[i].fs << endl;

   return 0;
}