#include typedef long long ll; using namespace std; int INF = 1e9; int MOD = 1e9+7; ll gcd (ll a,ll b){ if(!b)return a; return gcd(b,a%b); } main(){ ll x,y,z; cin >> x >> y >> z; if(z % gcd(x,y)){ cout << "NO" << endl; return 0; } ll min = INF; pair ans = make_pair(INF,INF); for(ll i = -100;i < 100;i++){ for(ll j = -100;j < 100;j++){ if(x*i + y*j == z)if(llabs(i)+llabs(j) < min){ min = llabs(i)+llabs(j); ans = make_pair(i,j); } } } ll a = ans.first,b = ans.second; if(llabs(a)*2+llabs(b)*2 > 20000){ cout << "NO" << endl; return 0; } string str; if(a < b || a == 0){ str += string(llabs(b),'w') + string(llabs(b)-1,'C'); if(a == 0)goto print; str += string(llabs(a),'c') + string(llabs(a)-1,'C'); str += (b<0?"W":"C"); }else{ str += string(llabs(a),'c') + string(llabs(a)-1,'C'); if(b == 0)goto print; str += string(llabs(b),'w') + string(llabs(b)-1,'C'); str += (a<0?"W":"C"); } print: if(str.length() > 10000)cout << "NO" << endl; else cout << str << endl; }