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

dp = [[[[] for _ in range(D+1)] for _ in range(K+1)] for _ in range(N+1)]
dp[0][0][0] = [0]

for i in range(N):
  for j in range(K+1):
    for k in range(D+1):
      if len(dp[i][j][k]) == 0:
        continue

      if len(dp[i+1][j][k]) == 0:
        dp[i+1][j][k] = dp[i][j][k]
      elif dp[i+1][j][k] > dp[i][j][k]:
        dp[i+1][j][k] = dp[i][j][k]

      if j+1 <= K and k+i+1 <= D:
        if len(dp[i+1][j+1][k+i+1]) == 0:
          dp[i+1][j+1][k+i+1] = dp[i][j][k] + [i+1]
        elif dp[i+1][j+1][k+i+1] > dp[i][j][k] + [i+1]:
          dp[i+1][j+1][k+i+1] = dp[i][j][k] + [i+1]

if sum(dp[N][K][D]) == D:
  print(*dp[N][K][D][1:])
else:
  print(-1)