program jkj;
var f,g:text;
   n,i,j,k:integer;
   x:array[0..19] of integer;
function cont(p:integer):boolean;
  begin
     if (p>1) and (x[p]<=x[p-1]) then
       cont:=false
       else
       cont:=true;
  end;
procedure bkt(p:integer);
var pval:integer;
   begin
     for pval:=1 to n do
        begin
           x[p]:=pval;
           if cont(p) then
             if p=k then
               begin
             for i:=1 to p do
                write(g,x[i],' ');
             writeln(g);
              end
                else
             bkt(p+1);
        end;
    end;
begin
assign(f,'combinari.in'); reset(f);
assign(g,'combinari.out'); rewrite(g);
  read(f,n,k);
  for i:=0 to 25 do
     x[i]:=0;
  x[0]:=0;
  bkt(1);
close(f);
close(g);
end.