package main import ( "bufio" "fmt" "os" "strconv" ) 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 = 2 } 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) dp[0][0] = 1 ans := make([]int, k) for i := n; i > 0; i-- { for ii := k; ii > 0; ii-- { for iii := d; iii >= i; iii-- { if dp[ii-1][iii-i] == 0 { continue } dp[ii][iii] = i if ii == k && iii == d { aii := ii aiii := iii for iiii := 0; iiii < k; iiii++ { ans[iiii] = dp[aii][aiii] aiii -= dp[aii][aiii] aii-- } } } } } if ans[0] == 0 { fmt.Fprintln(writer, -1) return } for i := 0; i < k; i++ { fmt.Fprint(writer, ans[i]) if i < k-1 { fmt.Fprint(writer, " ") continue } fmt.Fprintln(writer, "") } } func makeGrid(h, w int) [][]int { index := make([][]int, h, h) data := make([]int, h*w, h*w) for i := 0; i < h; i++ { index[i] = data[i*w : (i+1)*w] } return index }