package main import ( "bufio" "fmt" "os" "sort" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var wr = bufio.NewWriter(os.Stdout) func out(x ...interface{}) { fmt.Fprintln(wr, x...) } func getI() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getF() float64 { sc.Scan() i, e := strconv.ParseFloat(sc.Text(), 64) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getI() } return ret } func getS() 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 } // min for n entry func nmin(a ...int) int { ret := a[0] for _, e := range a { ret = min(ret, e) } return ret } // max for n entry func nmax(a ...int) int { ret := a[0] for _, e := range a { ret = max(ret, e) } return ret } 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 } // 拡張GCD func extGCD(a, b int) (int, int, int) { if b == 0 { return a, 1, 0 } d, y, x := extGCD(b, a%b) y -= a / b * x return d, x, y } func main() { defer wr.Flush() sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, 1000000) // this template is new version. // use getI(), getS(), getInts(), getF() x, y, z := getI(), getI(), getI() g, a, b := extGCD(x, y) // out(a, b, g, z) if z%g != 0 { out("NO") return } as, bs := byte('c'), byte('w') if a > b { as, bs = bs, as } n := z / g if n > 10000 { out("NO") return } s := make([]byte, 0) for i := 0; i < n; i++ { for j := 0; j < abs(a); j++ { s = append(s, as) } for j := 0; j < abs(a)-1; j++ { s = append(s, 'C') } for j := 0; j < abs(b); j++ { s = append(s, bs) } for j := 0; j < abs(b)-1; j++ { s = append(s, 'C') } if abs(b) != 0 { if b > 0 { s = append(s, 'W') } else { s = append(s, 'C') } } // out(string(s)) } for i := 0; i < n-1; i++ { s = append(s, 'C') } out(string(s)) }