N, i = map(int, input().split())

if i == 1:
    exit(print(N))

M = []
def dfs(upper, k, wa):
    # print(upper, k, wa, M)
    if wa == N:
        exit(print(*M))
    if k == 0:
        return
    
    for val in range(k, upper + 1):
        nume, deno = 1, 1
        for l in range(k):
            nume *= val - l
            deno *= l + 1
        
        nxt = nume // deno
        if wa + nxt > N:
            break

        M.append(val)
        dfs(nxt - 1, k - 1, wa + nxt)
        M.pop()


ok, ng = 0, N + i
while ng - ok > 1:
    mid = (ok + ng) >> 1

    nume, deno = 1, 1
    for l in range(i):
        nume *= mid - l
        deno *= l + 1

    if nume // deno > N:
        ng = mid
    else:
        ok = mid

dfs(ok, i, 0)