Problem Statement

Naoki has come to a candy shop to buy snacks for a school excursion.
The candy shop sells \(N\) kinds of snacks, priced at \(1, 2, 3 \dots N\) yen.

Naoki can buy snacks totaling up to \(D\) yen, and he can buy up to \(K\) snacks.
Naoki, who wants to eat a lot of snacks, added the following rules.

• Leaving money over would be a waste, so he buys snacks so that the total is exactly \(D\) yen
• He wants to eat a lot, so he buys \(K\) snacks
• He also wants to eat many kinds, so he buys at most \(1\) snack of any given price

Find the lexicographically smallest way of buying snacks that satisfies these rules.
If there is no such way of buying snacks, output \(-1\).

For the meaning of lexicographically smallest, refer to the samples.

Input

\(N\) \(D\) \(K\)

All inputs are given as integers

• \(1 \leq N \leq 100\)
• \(1 \leq D \leq 1000\)
• \(1 \leq K \leq 10\)

Output

Output the lexicographically smallest way of buying snacks that satisfies the rules, on one line, separated by spaces.
However, if there is no such way of buying snacks, output -1.

Sample

10 9 3

1 2 6

10 9 4

-1

30 40 4

1 2 7 30