a,b:array[1..5000] of longint;
i,j,k,jieguo,m,n,hao,score,p,q:longint;
procedure sort(l,r:longint);
var i,j,x,y:longint;
begin
i:=l;
j:=r;
x:=b[(i+j) div 2];
repeat
while b[i]>x do inc(i);
while b[j]<x do dec(j);
if i<=j then
begin
y:=b[i];
b[i]:=b[j];
b[j]:=y;
inc(i);
dec(j);
end;
until i>j;
if l<j then sort(l,j);
if i<r then sort(i,r);
end;
begin
read(n,m);
for i:=1 to n do
readln(a[i],b[i]);
{sort(1,n);}
for i:=1 to n-1 do
for j:=i+1 to n do
if b[i]<b[j] then
begin
k:=b[i];
b[i]:=b[j];
b[j]:=k;
k:=a[i];
a[i]:=a[j];
a[j]:=k;
end;
{for i:=1 to n do write(b[i]);}
m:=trunc(m*1.5);
while (m<n) and (b[m]=b[m+1]) do m:=m+1;
writeln(b[m],' ',m);
for i:=1 to m do
begin
if (b[i]=b[i+1]) and (a[i]>a[i+1]) then
begin
k:=a[i];
a[i]:=a[i+1];
a[i+1]:=k;
end;
p:=a[i];
q:=b[i];
writeln(p,' ',q);
end;
end.