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
}

var K, N, D int

func rec(a []int, ch chan []int) {
	if len(a) == K {
		ch <- a
		return
	}
	var s int
	if len(a) == 0 {
		s = 1
	} else {
		s = a[len(a)-1] + 1
	}
	for i := s; i <= N; i++ {
		rec(append(a, i), ch)
	}
	return
}

func next(ch chan []int) {
	rec([]int{}, ch)
	close(ch)
}

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

	ch := make(chan []int)
	go next(ch)

	for v := range ch {
		tot := 0
		for _, e := range v {
			tot += e
		}
		if tot == D {
			for _, e := range v {
				fmt.Print(e, " ")
			}
			out()
			return
		}
	}
	out(-1)
}