Program Combinari;
type natural = 0..maxint;
vect = array[natural] of natural;
var n,p:natural;
e,v,s:vect;
f,g:text;
function sol(k:natural):boolean;
begin
if k = p then
 sol:= true
 else sol:= false;
end;
procedure scrie(k:natural);
var i:natural;
begin
 for i:=1 to k do
  write(g,v[i],' ');
writeln(g);
end;
procedure backtrack(k:natural);
var i:natural;
begin
for i:= v[k-1]+1 to n do begin
v[k]:=i;
  if sol(k) then
   scrie(k)
   else backtrack(k+1);
 end;
end;
begin
assign(f,'combinari.in');
assign(g,'combinari.out');
reset(f);
rewrite(g);
readln(f,n,p);
backtrack(1);
close(f);close(g);
end.