import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
def solve(n,i):

    ans = []
    while n > 0:
        for j in range(i,1000000000):
            if math.comb(j,i) > n:
                j -= 1
                ans.append(j)
                n -= math.comb(j,i)
                i -= 1
                break
    print(*ans)
#for n in range(100000000-1000,100000000+1):
#    for i in range(1,101):
#        print(n,i)
#        solve(n,i)
#exit()
n,i = map(int,input().split())
solve(n,i)