package main import ( "bufio" "fmt" "math/big" "os" "strconv" "strings" ) func getScanner(fp *os.File) *bufio.Scanner { scanner := bufio.NewScanner(fp) scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, 1000005), 1000005) return scanner } func getNextString(scanner *bufio.Scanner) string { scanner.Scan() return scanner.Text() } func getNextInt(scanner *bufio.Scanner) int { i, _ := strconv.Atoi(getNextString(scanner)) return i } func getNextInt64(scanner *bufio.Scanner) int64 { i, _ := strconv.ParseInt(getNextString(scanner), 10, 64) return i } func getNextUint64(scanner *bufio.Scanner) uint64 { i, _ := strconv.ParseUint(getNextString(scanner), 10, 64) return i } func getNextFloat64(scanner *bufio.Scanner) float64 { i, _ := strconv.ParseFloat(getNextString(scanner), 64) return i } func main() { fp := os.Stdin wfp := os.Stdout cnt := 0 if os.Getenv("MASPY") == "ますピ" { fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT")) cnt = 3 } if os.Getenv("MASPYPY") == "ますピッピ" { wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10")) } scanner := getScanner(fp) writer := bufio.NewWriter(wfp) solve(scanner, writer) for i := 0; i < cnt; i++ { fmt.Fprintln(writer, "-----------------------------------") solve(scanner, writer) } writer.Flush() } func solve(scanner *bufio.Scanner, writer *bufio.Writer) { n := getNextInt(scanner) d := getNextInt(scanner) k := getNextInt(scanner) dp := makeGrid(k+1, d+1) for i := 0; i < k+1; i++ { for j := 0; j < d+1; j++ { dp[i][j] = newBint(0) } } dp[0][0].x.Add(dp[0][0].x, big.NewInt(1)) for i := n; i > 0; i-- { for ii := k; ii > 0; ii-- { for iii := d; iii >= i; iii-- { if dp[ii-1][iii-i].x.Bit(0) == 0 { continue } dp[ii][iii].x.SetBit(dp[ii-1][iii-i].x, i, 1) } } } if dp[k][d].x.Bit(0) == 0 { fmt.Fprintln(writer, -1) return } ans := make([]string, 0) for i := 1; i <= n; i++ { if dp[k][d].x.Bit(i) == 0 { continue } ans = append(ans, fmt.Sprintf("%d", i)) } fmt.Fprintln(writer, strings.Join(ans, " ")) } func makeGrid(h, w int) [][]*bint { index := make([][]*bint, h, h) data := make([]*bint, h*w, h*w) for i := 0; i < h; i++ { index[i] = data[i*w : (i+1)*w] } return index } type bint struct { x *big.Int } func newBint(x int64) *bint { return &bint{x: big.NewInt(x)} } func (x *bint) add(y *bint) *bint { z := newBint(0) z.x.Add(x.x, y.x) return z } func (x *bint) sub(y *bint) *bint { z := newBint(0) z.x.Sub(x.x, y.x) return z } func (x *bint) mul(y *bint) *bint { z := newBint(0) z.x.Mul(x.x, y.x) return z } func (x *bint) div(y *bint) *bint { z := newBint(0) z.x.Div(x.x, y.x) return z } func (x *bint) lsh(n int) *bint { z := newBint(0) z.x.Lsh(x.x, uint(n)) return z } func (x *bint) rsh(n int) *bint { z := newBint(0) z.x.Rsh(x.x, uint(n)) return z } func (x *bint) or(y *bint) *bint { z := newBint(0) z.x.Or(x.x, y.x) return z } func (x *bint) and(y *bint) *bint { z := newBint(0) z.x.And(x.x, y.x) return z }