program damele;
type stiva=array[1..100]of integer;
var st:stiva;
    n,k,p:integer;
    as,ev:boolean;
    f,g:text;
procedure init(k:integer;var st:stiva);
    begin
    st[k]:=0;
    end;
procedure succesor(var as:boolean;var st:stiva;k:integer);
    begin
    if st[k]<n-p+k then begin
                    st[k]:=st[k]+1;
                    as:=true;
                    end
    else as:=false;
    end;
procedure valid(var ev:boolean;var st:stiva;k:integer);
    var i:integer;
    begin
    ev:=true;
    for i:=1 to k-1 do
       if (st[k]=st[i]) then ev:=false ;
    if k>1 then if st[k]<st[k-1] then ev:=false;
    end;
function solutie(k:integer):boolean;
    begin
    solutie:=(k=p);
    end;
procedure tipar;
  var i:integer;
  begin
  for i:=1 to p do write(g,st[i],' ');
  writeln(g);
  end;
begin
assign(f,'combinari.in');reset(f);
assign(g,'combinari.out');rewrite(g);
readln(f,n);
readln(f,p);
k:=1;
init(k,st);
while k>0 do
   begin
   repeat succesor(as,st,k);
   if as then valid(ev,st,k);
   until (not as) or (as and ev);
   if as then
             if solutie(k) then tipar
             else begin
                  k:=k+1;
                  init(k,st);
                  end
   else k:=k-1;
   end;
   close(f);close(g);
end.