#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const int INF = 99999;

string build_sub_code(int a, int b) {
  string code = "";

  for (int i = 0; i < a; ++i) {
    code += "c";
    if (i > 0) {
      code += "C";
    }
  }
  for (int i = 0; i < b; ++i) {
    code += "w";
    if (code.size() >= 2) {
      code += "C";
    }
  }

  return code;
}

string build_code(int a, int b, int c, int d) {
  string code1 = build_sub_code(a, b);
  string code2 = build_sub_code(c, d);

  if (c + d == 0) {
    return code1;
  } else {
    return code2 + code1 + "W";
  }
}

int main() {
  int X, Y, Z;
  cin >> X >> Y >> Z;
  int cnt = 0;

  map<ll, int> memo;
  map<ll, int> min_counter;

  for (int a = 0; a <= 5000; ++a) {
    for (int b = 0; b <= 5000; ++b) {
      int n = a + b;
      if (2 * n - 1 > 10000) break;
      int c = a * 10000 + b;
      ll v = a * X + b * Y;

      if (memo[v] == 0 || min_counter[v] > n) {
        min_counter[v] = n;
        memo[v] = c;
      }
    }
  }

  for (auto [k, c] : memo) {
    ll r = k - Z;
    int a = c / 10000;
    int b = c % 10000;

    if (r == 0) {
      string code = build_code(a, b, 0, 0);
      cout << code << endl;
      return 0;
    } else if (memo.count(r)) {
      int nc = memo[r];
      int na = nc / 10000;
      int nb = nc % 10000;

      string code = build_code(a, b, na, nb);
      cout << code << endl;
      return 0;
    }
  }

  cout << "NO" << endl;

  return 0;
}