#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
from queue import PriorityQueue
import bisect
import heapq

def input():
    return sys.stdin.readline()[:-1]

sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """30 40 4
# """
# sys.stdin = io.StringIO(_INPUT)


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

    dp = [[[list() for _ in range(K+1)] for _ in range(D+1)] for _ in range(N+1)]
    dp[0][0][0] = [0]
    for n in range(0, N):
        for d in range(0, D+1):
            for k in range(0, K+1):
                if dp[n][d][k]:
                    if d + (n+1) <= D and k + 1 <= K:
                        if dp[n+1][d+(n+1)][k+1]:
                            dp[n+1][d+(n+1)][k+1] = min(dp[n+1][d+(n+1)][k+1], dp[n][d][k] + [n+1])
                        else:
                            dp[n+1][d+(n+1)][k+1] = dp[n][d][k] + [n+1]
                    if dp[n+1][d][k]:
                        dp[n+1][d][k] = min(dp[n+1][d][k], dp[n][d][k])
                    else:
                        dp[n+1][d][k] = dp[n][d][k]

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


if __name__ == '__main__':
    main()