全排，有一个点蜜汁不输出，求求大佬解答

var i,total,n,m,p,j:longint;
    f:array[1..10010] of boolean;
    a,b:array[1..10010] of longint;
procedure dfs(dep,sign:longint);
  var i:longint;
  begin
    if dep=0 then dfs(dep+1,sign);

      then
        begin
          inc(total);
          if total>m then
            begin
              for i:=1 to n-1 do write(a[i],' ');
              writeln(a[n]);
              halt;
            end;
        end
      else
       if sign=1
         then
           begin
             for i:=b[dep] to n do
               if f[i]=false then
                begin
                  a[dep]:=i;
                  f[i]:=true;
                  if i=b[dep] then dfs(dep+1,1)
                  else dfs(dep+1,2);
                  f[i]:=false;
                end;
           end
         else
        for i:=1 to n do
          if f[i]=false then
            begin
              a[dep]:=i;
              f[i]:=true;
              dfs(dep+1,2);
              f[i]:=false;
            end;
  end;
begin
  readln(n);
  readln(m);
  for i:=1 to n do begin read(a[i]);b[i]:=a[i];end;
  total:=0;
  p:=1;
  for i:=2 to n do
    begin
      if p*i>m then break;
      p:=p*i;
    end;
  fillchar(f,sizeof(f),false);
  for j:=1 to n-i-2 do f[a[j]]:=true;
  dfs(n-i-1,1);
end.