Program K_Perm;

const
  Max = 100;

var

  fact : array[0..Max] of longint;
  perm : array[1..Max] of integer;
  use : array[1..Max] of boolean;
  i,j,l : integer;
  cif : integer;
  n,k : integer;


begin

 readln(n,k);

 fact[0]:=1;
 fact[1]:=1;

 for i:=2 to n do
    fact[i]:=i*fact[i-1];

 if (k < 1) or (k > fact[n]) then
  begin
    writeln(k,' musi byt v rozmezi 1..',fact[n]);
    exit;
  end;

 for i:=1 to n do
    use[i]:=false;

 for i:=1 to n do
  begin
    cif:=1+(k-1) div fact[n-i];
    k:=k-(cif-1)*fact[n-i];
    { nalezeni cif-te volne cifry }
    j:=1;
    l:=0;
    while (l < cif) do
     begin
      if (not use[j]) then inc(l);
      inc(j);
     end;
    perm[i]:=j-1;
    use[j-1]:=true;
  end;

  for i:=1 to n do
   write (perm[i],' ');
 writeln;


end.

