var

a:array[1..100] of longint;

b:array[1..100] of boolean;

n,i,t,q,w:integer;

procedure search(depth:integer);

var

i:integer;

begin

if depth>n then

begin

inc(t);

if t=q then begin

for i:= 1 to n do

write(a[i],' ');

halt;

end;

exit;

end;

for i:= 1 to n do

if b[i]=false then

begin

a[depth]:=i;

b[i]:=true;

search(depth+1);

b[i]:=false;

end;

end;

begin

t:=0;

read(n,q);

fillchar(b,sizeof(b),false);

search(1);

end.