#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int x,y,z,a,b;

void check() {
    a = b = INT_MAX;
    REP(i,5001) REP(j,2) {
        int t = j ? i : -i;
        int n = z - t*x;
        if (n%y==0) {
            a = t;
            b = n / y;
            return;
        }
        n = z - t*y;
        if (n%x==0) {
            a = n / x;
            b = t;
            return;
        }
    }
}
string ans;
void add(int a, string o) {
    string op = (a < 0) ? "W" : "C";
    REP(i,abs(a)) {
        ans = o + ans + op;
    }
}

void solve() {
    cin>>x>>y>>z;
    check();
//    out("%lld %lld\n", a, b);
    
    if (a==INT_MAX) {
        cout << "NO" << endl;
        return;
    }
    
    if (a < b) {
        add(b, "w");
        add(a, "c");
    } else {
        add(a, "c");
        add(b, "w");
    }
    if (ans.size() > 10000) {
        cout << "NO" << endl;
        return;
    }
    cout << ans << endl;
}