program combinari;
type    solutie=array[0..30] of integer;

var     s:solutie;
        n,p,k:integer;
        f,g:text;

procedure back(k:integer);
var     i:integer;
begin
        if k=p+1 then
                begin
                for i:=1 to p do
                        write(g,s[i],' ');
                writeln(g);
                end
        else
                for i:=s[k-1]+1 to n-p+k do
                        begin
                        s[k]:=i;
                        back(k+1);
                        end;
        s[k]:=0;
end;

begin
assign(f,'combinari.in');reset(f);
assign(g,'combinari.out');rewrite(g);
read(f,n,p);
back(1);
close(g);
end.