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

def binom(n, r):
  res = 1
  r = min(r, n - r)
  for j in range(1, r + 1):
    res *= (n + 1 - j)
    res //= j
    if res > N:
      return res
  return res

S = [[] for _ in range(i + 1)]
for j in range(1, i + 1):
  for n in range(j, N + 1):
    if binom(n, j) > N:
      break
    S[j].append((binom(n, j), n))

ans = []
while N:
  S[i].sort()
  while S[i]:
    s, n = S[i].pop()
    if N >= s:
      N -= s
      ans.append(n)
      break
  i -= 1
print(*ans)