N, D, K = map(int,input().split())

def dfs(i, arr):
  if len(arr) == K:
    if sum(arr) == D:
      print(*arr)
      exit()
    else:
      return

  for j in range(i+1, N+1):
    if sum(arr) + j > D:
      break
    dfs(j, arr + [j])

dfs(1, [1])
print(-1)