#line 2 "/home/sakflat/CP/_library/cpp/template/template.cpp"

//yukicoder@cpp17

#include <iostream>
#include <iomanip>

#include <algorithm>

#include <cmath>
#include <cctype>
#include <climits>
#include <cassert>

#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>

#include <bitset>

#include <complex>

#include <utility>

#include <numeric>

#include <functional>


using namespace std;
using ll = long long;
using P = pair<ll,ll>;

const ll MOD = 998244353;
const ll MODx = 1000000007;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62LL)-1;
const double EPS = (1e-10);

P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};
P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};




template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
 
 /*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる

計算量は変わらないが楽できるシリーズ
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/

/*
function corner below
*/


/*
Function corner above
*/

/* comment outed because can cause bugs
__attribute__((constructor))
void initial() {
 cin.tie(0);
 ios::sync_with_stdio(false);
}
*/
#line 2 "/home/sakflat/CP/_library/cpp/template/basic.cpp"

int main(){
  long long x,y,z;cin>>x>>y>>z;
  if(z == 0){
    cout << "ccW" << endl;
    return 0;
  }
  if(x == 0 || y == 0){
    if(x+y == 0){
      cout << (z ? "NO" : "c") << endl;
    }else{
      if(z%(x+y))cout << "NO" << endl;
      else{
        if(z/(x+y) > 5000)cout << "NO" << endl;
        else{
          for(int i = 0; z/(x+y) > i; i++){
            cout << (x ? "c" : "w");
          }
          for(int i = 0; z/(x+y)-1 > i; i++){
            cout << "C";
          }
          cout << endl;
        }
      }
    }
    return 0;
  }
  long long g = __gcd(x,y);
  if(z % g){
    cout << "NO" << endl;
    return 0;
  }
  x /= g; y /= g; z /= g;
  for(long long a = -5000; 5000 > a; a++){
    if((a*x-z)%y == 0){
      long long b = -(a*x-z)/y;
      long long length = (abs(a) + abs(b))*2 - 1;
      if(a <= 0 && b <= 0)length += 3;
      if(length > 10000)continue;
      string C = "";
      string O = "";
      if(a > 0){
        for(int i = 0; a > i; i++){
          C.push_back('c');
          if(i)O.push_back('C');
        }
      }
      if(b > 0){
        if(C.size())O.push_back('C');
        for(int i = 0; b > i; i++){
          C.push_back('w');
          if(i)O.push_back('C');
        }
      }
      if(a < 0){
        if(C.size())O.push_back('W');
        for(int i = 0; -a > i; i++){
          C.push_back('c');
          if(i)O.push_back('W');
        }
      }
      if(b < 0){
        if(C.size())O.push_back('W');
        for(int i = 0; -b > i; i++){
          C.push_back('w');
          if(i)O.push_back('W');
        }
      }
      reverse(C.begin(), C.end());
      cout << C << O << endl;

      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}