#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;using vb=vector<bool>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template <typename T> T read() {T t; cin >> t; return t;}

// ax+by=gcd(a,b) を満たす x,y を求める。戻り値は gcd(a,b)
long long extgcd(long long a, long long b, long long& x, long long& y) {
  long long g = a; x = 1; y = 0;
  if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
  return g;
}

void panic() {
  cout << "mourennaihasimasenn" << endl;
  exit(0);
}

string minu(char c, int n) {
  string ret;
  rep(i, n) {
    ret += c;
    ret += 'W';
  }
  return ret;
}

string neg(char c, int n) {
  string ret;
  rep(i, n+2) ret += c;
  rep(i, n) ret += 'C';
  ret += 'W';
  return ret;
}

string pos(char c, int n) {
  string ret;
  rep(i, n) ret += c;
  rep(i, n-1) ret += 'C';
  return ret;
}

string solve() {
  int c = read<int>();
  int w = read<int>();
  int Z = read<int>();

  ll nc, nw;

  ll g = extgcd(c, w, nc, nw);
  if (Z % g != 0) {
    panic();
  }

  if (nc == 0 && nw == 0) {
    return "";
  }

  //cout<<"g: "<<g<<endl;
  //cout<<"nc: "<<nc<<endl;
  //cout<<"nw: "<<nw<<endl;

  nc *= (Z/g);
  nw *= (Z/g);

  //cout<<"nc: "<<nc<<endl;
  //cout<<"nw: "<<nw<<endl;

  if (nc == 0) {
    if (nw < 0) {
      int len = 2 * -nw + 3;
      if (len > 10000) panic();
      return neg('w', -nw);
    }
    else {
      int len = 2 * nw -1;
      if (len > 10000) panic();
      return pos('w', nw);
    }
  }
  if (nw == 0) {
    if (nc < 0) {
      int len = 2 * -nc + 3;
      if (len > 10000) panic();
      return neg('c', -nc);
    }
    else {
      int len = 2 * nc -1;
      if (len > 10000) panic();
      return pos('c', nc);
    }
  }

  if (nc > 0 && nw > 0) {
    string ret;
    int len = 2 * nc - 1 + 2 * nw - 1 + 1;
    if (len > 10000) panic();
    ret += pos('c', nc);
    ret += pos('w', nw);
    ret += 'C';
    return ret;
  }
  if (nc > 0 && nw < 0) {
    string ret;
    int len = 2 * nc - 1 + 2 * nw;
    if (len > 10000) panic();
    ret += pos('c', nc);
    ret += minu('w', -nw);
    return ret;
  }
  if (nc < 0 && nw > 0) {
    string ret;
    int len = 2 * nw - 1 + 2 * nc;
    if (len > 10000) panic();
    ret += pos('w', nw);
    ret += minu('c', -nc);
    return ret;
  }
  if (nc < 0 && nw < 0) {
    string ret;
    int len = 2 * nc - 1 + 2 * nw;
    if (len > 10000) panic();
    ret += neg('c', nc);
    ret += minu('w', -nw);
    return ret;
  }
  assert(false);
}

void Main() {
  cout << solve() << endl;
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }