program B;
var
N,K,i,j,max:longint;
a:array[1..200000,1..2] of longint;
begin
 max:=-2147483647;
 readln(N,K);
 for i:=1 to N do
   begin
    readln(a[i,1],a[i,2]);
   end;
   for i:=1 to N do
    for j:=1 to 2 do
     if (a[i,j] > max) then max:=a[i,j];
  while (K>0) do
  begin
   for i:=1 to N do
    for j:=1 to 2 do
    begin
     if (a[i,1] = max) and (i<>1) and (i<>N) and  (a[i-1,1] > a[i+1,1]) and (a[i-1,1] > a[i,2]) then
      begin
       a[i-1,1]:=1;
       a[i,1]:=1;
       max:=-2147483647;
      end
     else if (a[i,1] = max) and (i<>1) and (i<>N) and  (a[i+1,1] > a[i-1,1]) and (a[i+1,1] > a[i,2]) then
      begin
       a[i+1,1]:=1;
       a[i,1]:=1;
       max:=-2147483647;
      end
     else if (a[i,1] = max) and (i<>1) and (i<>N) and  (a[i,2] > a[i-1,1]) and (a[i+1,1] < a[i,2]) then
      begin
       a[i,2]:=1;
       a[i,1]:=1;
       max:=-2147483647;
      end
     else if(a[i,2] = max) and (i<>1) and (i<>N) and  (a[i-1,2] > a[i+1,2]) and (a[i-1,2] > a[i,1]) then
      begin
       a[i-1,2]:=1;
       a[i,2]:=1;
       max:=-2147483647;
      end
     else if (a[i,2] = max) and (i<>1) and (i<>N) and  (a[i+1,2] > a[i-1,2]) and (a[i+1,2] > a[i,1]) then
      begin
       a[i+1,2]:=1;
       a[i,2]:=1;
       max:=-2147483647;
      end
     else if (a[i,2] = max) and (i<>1) and (i<>N) and  (a[i,1] > a[i-1,2]) and (a[i+1,2] < a[i,1]) then
      begin
       a[i,1]:=1;
       a[i,2]:=1;
       max:=-2147483647;
      end
     end;
     k:=k-1;
    end;
   for i:=1 to N do
    for j:=1 to 2 do
     writeln(a[i,j]);
end.