def cww(s,x,y):
    st = []
    for i in s:
        if i=="c": st.append(x)
        elif i=="w": st.append(y)
        elif i=="C":
            a = st.pop()
            b = st.pop()
            st.append(a+b)
        elif i=="W":
            a = st.pop()
            b = st.pop()
            st.append(a-b)
        else:
            assert 0
    return st[-1]

def extgcd(x,y):
    if y==0: return 1,0 #g=x
    r0,r1,s0,s1 = x,y,1,0
    while r1 != 0:
        r0,r1, s0,s1 = r1,r0%r1, s1,s0-r0//r1*s1
    return r0,s0,(r0-s0*x)//y

from math import gcd
x,y,z = map(int,input().split())
if x>y: x,y = y,x

g,A,B = extgcd(x,y)
if z%g:
    print("NO")
    exit()

def ans(A,B):
    if abs(A)+abs(B) > 5000: return
    #print(A,B)
    if A >= 0 and B >= 0:
        s = "c"*A+"w"*B+"C"*(A+B-1)
        return s
    if A >= 0:
        B = -B
        s = "w"*B+"c"*A+"C"*(A-1)+"W"*B
        return s
    if B >= 0:
        A = -A
        s = "c"*A+"w"*B+"C"*(B-1)+"W"*A
        return s
    return None
A *= z//g
B *= z//g
A %= y
B = (z-A*x)//y
assert A*x+B*y==z
s = ans(A,B)
if s:
    print(s)
    assert cww(s,x,y)==z
    exit()
AA = A-y//g
BB = B+x//g
assert AA*x+BB*y==z
s = ans(A,B)
if s:
    print(s)
    assert cww(s,x,y)==z
    exit()

print("NO")