#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<ctype.h>
int main()
{
int m, n, k=0, j, i;
scanf("%d%d", &n,&m);
int** a = (int**)malloc(n * sizeof(int*));
for (i = 0; i < n; i++)
{
a[i] = (int*)malloc(2 * sizeof(int));
scanf("%d%d", &a[i][0], &a[i][1]);
}
m = (m * 1.5);
for(j=0;j<n;j++)
for (i = 0; i < n- 1; i++)
{
if (a[i][1] < a[i + 1][1])
{
int* p = a[i];
a[i] = a[i + 1];
a[i + 1] = p;
}
}
for (i = n - 1; i >= 0; i--)
{
if (a[i][1] == a[m-1][1])
{
k = i + 1;
break;
}
}
printf("%d %d\n", a[m-1][1], k);
for (i = 0; i <n-1; i++)
{
if(a[i][1]==a[i+1][1]&&a[i][0]>a[i+1][0])
{
int* p = a[i];
a[i] = a[i + 1];
a[i + 1] = p;
}
}
for (i = 0; i < k; i++)
{
printf("%d %d\n", a[i][0], a[i][1]);
}
return 0;
}