import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, D, K = map(int, input().split())
dp = [[False for _ in range(D + 1)] for _ in range(K + 1)]
pre = [[0 for _ in range(D + 1)] for _ in range(K + 1)]
dp[0][0] = True

for i in range(1, N + 1):
    for j in range(K, 0, -1):
        for k in range(D, 0, -1):
            if k - i < 0:
                break
            if dp[j - 1][k - i] is False:
                continue
            dp[j][k] = True
            pre[j][k] = max(pre[j][k], i)

if dp[K][D] is False:
    print(-1)
else:
    ans = []
    cnt = K
    price = D
    for _ in range(K):
        p = pre[cnt][price]
        ans.append(p)
        cnt -= 1
        price -= p
    ans.reverse()
    print(*ans)