def bin_search(ok, ng, is_ok):
   while abs(ok-ng) > 1:
      mid = (ok+ng)//2
      if is_ok(mid):
         ok = mid
      else:
         ng = mid
   return ok


def solve(N, i):
   from math import comb as C
   if N == 0:
      return []
   n = bin_search(i, max(i,N)+1, lambda n: C(n, i) <= N)
   N -= C(n, i)
   return [n] + solve(N, i-1)


N, i = map(int, input().split())
res = solve(N, i)
print(*res)