def increasing_sequence(k,n,now=0,cur=[],nowi=0): #now代表当前几个数字,
#nowi代表当前最大的一个数字
if(k==now):
for i in range(len(cur)):
print(cur[i],end=' ')
print()
return
else:
for i in range(nowi,n+now):
cur.append(i+1)
nowi=cur[-1]
increasing_sequence(k,n-1,now+1,cur,nowi)
cur.pop()
increasing_sequence(2,3)
increasing_sequence(5,5)