package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func next(a []int, N int) []int {
	n := len(a) - 1
	a[n]++
	for i := n; i > 0; i-- {
		if a[i] > N {
			a[i] -= N + 1
			a[i-1]++
		} else {
			break
		}
	}
	return a
}

func main() {
	sc.Split(bufio.ScanWords)
	N, D, K := getInt(), getInt(), getInt()

	if D > N*(N+1)/2 {
		out(-1)
		return
	}

	tot := 0
	a := make([]int, 0)
	for i := 1; i <= K; i++ {
		a = append(a, i)
		tot += i
	}

	for {
		flg := true
		for i := 1; i < len(a); i++ {
			if a[i] <= a[i-1] {
				flg = false
				break
			}
		}
		if flg {
			// out(a)
			tot := 0
			for _, v := range a {
				tot += v
			}
			if tot == D {
				for i := 0; i < len(a); i++ {
					fmt.Print(a[i], " ")
				}
				out()
				return
			}
		}
		a = next(a, N)
		if a[0] == N+2-len(a) {
			break
		}
	}
	out(-1)
}