program combinari;

 var x:array[1..18] of byte;
     n,i,k:byte;

 procedure ki(l:byte);
 var j:byte;
 begin
  for j := 1 to l do
   write(g,x[j],' ');
 writeln;
 end;

 function jo(lep:byte):boolean;
 var ok:boolean;
     j:byte;
 begin
 ok := true;
  for j := 1 to lep-1 do
   if x[lep] = x[j] then ok := false;
  if (lep>=2) and (x[lep-1]>x[lep]) then ok := false;
 jo:=ok;
 end;

 procedure back(lep:byte);
 var j:byte;
 begin
  for j := 1 to n do begin
   x[lep] := j;
   if jo(lep) and (lep = k) then ki(lep);
                            else back(lep+1);
  end;
 end;

 Begin
 assign(f,'combinari.in'); reset(f); readln(f,n,k); close(f);
 assign(g,'combinari.out'); rewrite(g);
 back(1);
 close(g);
 End.