#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;

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

      if (a == 0 && b == 0) {
        cout << "ccW" << endl;
        return 0;
      } else if (a * X + b * Y == Z) {
        string code = build_code(a, b, 0, 0);
        cout << code << endl;
        return 0;
      } else if (a * X - b * Y == Z) {
        string code = build_code(a, 0, 0, b);
        cout << code << endl;
        return 0;
      } else if (b * Y - a * X == Z) {
        string code = build_code(0, b, a, 0);
        cout << code << endl;
        return 0;
      }
    }
  }

  cout << "NO" << endl;

  return 0;
}